Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
From data to decisions: Distributionally robust optimization is optimal
We study stochastic programs where the decision maker cannot observe the distribution of
the exogenous uncertainties but has access to a finite set of independent samples from this …
the exogenous uncertainties but has access to a finite set of independent samples from this …
Information theory with kernel methods
F Bach - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
We consider the analysis of probability distributions through their associated covariance
operators from reproducing kernel Hilbert spaces. We show that the von Neumann entropy …
operators from reproducing kernel Hilbert spaces. We show that the von Neumann entropy …
Semidefinite approximations of the matrix logarithm
The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with
respect to the positive semidefinite order. This operator concavity property leads to …
respect to the positive semidefinite order. This operator concavity property leads to …
Relative entropy regularized TDLAS tomography for robust temperature imaging
Tunable diode laser absorption spectroscopy (TDLAS) tomography has been widely used
for in situ combustion diagnostics, yielding images of both species concentration and …
for in situ combustion diagnostics, yielding images of both species concentration and …
On variational expressions for quantum relative entropies
Distance measures between quantum states like the trace distance and the fidelity can
naturally be defined by optimizing a classical distance measure over all measurement …
naturally be defined by optimizing a classical distance measure over all measurement …
Optimal self-concordant barriers for quantum relative entropies
Quantum relative entropies are jointly convex functions of two positive definite matrices that
generalize the Kullback–Leibler divergence and arise naturally in quantum information …
generalize the Kullback–Leibler divergence and arise naturally in quantum information …
A positivstellensatz for sums of nonnegative circuit polynomials
Recently, the second and third authors developed sums of nonnegative circuit polynomials
(SONC) as a new certificate of nonnegativity for real polynomials, which is independent of …
(SONC) as a new certificate of nonnegativity for real polynomials, which is independent of …
Efficient optimization of the quantum relative entropy
Many quantum information measures can be written as an optimization of the quantum
relative entropy between sets of states. For example, the relative entropy of entanglement of …
relative entropy between sets of states. For example, the relative entropy of entanglement of …
On the convex formulations of robust Markov decision processes
Robust Markov decision processes (MDPs) are used for applications of dynamic
optimization in uncertain environments and have been studied extensively. Many of the …
optimization in uncertain environments and have been studied extensively. Many of the …
Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
G Averkov - SIAM Journal on Applied Algebra and Geometry, 2019 - SIAM
The abbreviations LMI and SOS stand for “linear matrix inequality" and “sum of squares,"
respectively. The cone n,2d of SOS polynomials in n variables of degree at most 2d is known …
respectively. The cone n,2d of SOS polynomials in n variables of degree at most 2d is known …