Search Results for author:
Found 3 papers, 2 papers with code
Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging
For the Poisson inverse problem, our algorithm attains an $\varepsilon$-optimal solution in $\smash{\tilde{O}}(d^2/\varepsilon^2)$ time, matching the state of the art, where $d$ denotes the dimension.
Faster Stochastic First-Order Method for Maximum-Likelihood Quantum State Tomography
In maximum-likelihood quantum state tomography, both the sample size and dimension grow exponentially with the number of qubits.
Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States
For online portfolio selection, the regret of online mirror descent with the logarithmic barrier is $\tilde{O}(\sqrt{T d})$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
