The following pages link to Satyen Kale (Q1009220):
Displayed 24 items.
- Logarithmic regret algorithms for online convex optimization (Q1009221) (← links)
- Learning rotations with little regret (Q1689555) (← links)
- Extracting certainty from uncertainty: regret bounded by variation in costs (Q1959595) (← links)
- Noise Tolerance of Expanders and Sublinear Expansion Reconstruction (Q2839180) (← links)
- The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
- (Q2913806) (← links)
- An optimal algorithm for stochastic strongly-convex optimization (Q2934088) (← links)
- (Q2934613) (← links)
- $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time (Q3053148) (← links)
- A Combinatorial, Primal-Dual Approach to Semidefinite Programs (Q3177769) (← links)
- (Q3549617) (← links)
- A Fast Random Sampling Algorithm for Sparsifying Matrices (Q3595390) (← links)
- Online Semidefinite Programming. (Q4598178) (← links)
- (Q4633809) (← links)
- (Q4633934) (← links)
- AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION (Q5247422) (← links)
- Logarithmic Regret Algorithms for Online Convex Optimization (Q5307589) (← links)
- (Q5396640) (← links)
- (Q5405212) (← links)
- Near-Optimal Algorithms for Online Matrix Prediction (Q5737809) (← links)
- Online learning of quantum states (Q5854122) (← links)
- An Expansion Tester for Bounded Degree Graphs (Q5894298) (← links)
- An Expansion Tester for Bounded Degree Graphs (Q5900243) (← links)
- Private Matrix Approximation and Geometry of Unitary Orbits (Q6404189) (← links)