The following pages link to Yair Carmon (Q1002087):
Displaying 11 items.
- Markov decision processes with exponentially representable discounting (Q1002088) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Lower bounds for finding stationary points II: first-order methods (Q2220663) (← links)
- Lower Bounds and Approximations for the Information Rate of the ISI Channel (Q2977222) (← links)
- Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs (Q2978684) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- Information, Estimation, and Lookahead in the Gaussian Channel (Q4622047) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
- Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
- A whole new ball game: a primal accelerated method for matrix games and minimizing the maximum of smooth functions (Q6645496) (← links)
