#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1965

2018

- This year (5)
- Last 5 years (23)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Elad Hazan, Adam Tauman Kalai, Satyen Kale, Amit Agarwal
- Machine Learning
- 2006

In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After each point is chosen,â€¦ (More)

- Sanjeev Arora, Elad Hazan, Satyen Kale
- Theory of Computing
- 2012

Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analysis are usually veryâ€¦ (More)

The contingency table is a work horse of official statistics, the format of reported data for the US Census, Bureau of Labor Statistics, and the Internal Revenue Service. In many settings such asâ€¦ (More)

- Elad Hazan, Satyen Kale
- COLT
- 2011

We give a novel algorithm for stochastic strongly-convex optimization in the gradient oracle model which returns an O( 1 T )-approximate solution after T gradient updates. This rate of convergence isâ€¦ (More)

- Sanjeev Arora, Satyen Kale
- STOC
- 2007

Semidefinite programs (SDPs) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-known multiplicativeâ€¦ (More)

- Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire
- ICML
- 2006

We experimentally study on-line investment algorithms first proposed by Agarwal and Hazan and extended by Hazan et al. which achieve almost the same wealth as the best constant-rebalanced portfolioâ€¦ (More)

We present a new algorithm for the contextual bandit learning problem, where the learner repeatedly takes one of K actions in response to the observed context, and observes the reward only for thatâ€¦ (More)

We describe novel subgradient methods for a broad class of matrix optimization problems involving nuclear norm regularization. Unlike existing approaches, our method executes very cheap iterations byâ€¦ (More)

- Arpita Ghosh, Satyen Kale, R. Preston McAfee
- EC
- 2011

A large fraction of user-generated content on the Web, such as posts or comments on popular online forums, consists of abuse or spam. Due to the volume of contributions on popular sites, a fewâ€¦ (More)

- Elad Hazan, Satyen Kale, Shai Shalev-Shwartz
- COLT
- 2012

In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparison class isâ€¦ (More)