Satyen Kale

Available identifiers

zbMath Open kale.satyenMaRDI QIDQ1009220

List of research outcomes

Publication	Date of Publication	Type
Private Matrix Approximation and Geometry of Unitary Orbits	2022-07-06	Paper
Online learning of quantum states	2021-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4633934	2019-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q4633809	2019-05-06	Paper
A Combinatorial, Primal-Dual Approach to Semidefinite Programs	2018-08-02	Paper
Learning rotations with little regret	2018-01-12	Paper
Online Semidefinite Programming.	2017-12-19	Paper
Near-Optimal Algorithms for Online Matrix Prediction	2017-05-30	Paper
AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION	2015-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q2934613	2014-12-18	Paper
An optimal algorithm for stochastic strongly-convex optimization	2014-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5405212	2014-04-01	Paper
https://portal.mardi4nfdi.de/entity/Q5396640	2014-02-03	Paper
The Approximability of the Binary Paintshop Problem	2013-10-04	Paper
Noise tolerance of expanders and sublinear expansion reconstruction	2013-07-04	Paper
The multiplicative weights update method: a meta-algorithm and applications	2012-09-27	Paper
An Expansion Tester for Bounded Degree Graphs	2011-10-18	Paper
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time	2010-11-04	Paper
Extracting certainty from uncertainty: regret bounded by variation in costs	2010-10-07	Paper
Logarithmic regret algorithms for online convex optimization	2009-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q3549617	2009-01-05	Paper
An Expansion Tester for Bounded Degree Graphs	2008-08-28	Paper
Logarithmic Regret Algorithms for Online Convex Optimization	2007-09-14	Paper
A Fast Random Sampling Algorithm for Sparsifying Matrices	2007-08-28	Paper

Research outcomes over time

This page was built for person: Satyen Kale