Picture for Ankan Saha

Ankan Saha

University of Chicago

Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences

Add code
Oct 02, 2017
Figure 1 for Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
Figure 2 for Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
Figure 3 for Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
Figure 4 for Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
Viaarxiv icon

Constrained Multi-Slot Optimization for Ranking Recommendations

Add code
May 16, 2017
Figure 1 for Constrained Multi-Slot Optimization for Ranking Recommendations
Figure 2 for Constrained Multi-Slot Optimization for Ranking Recommendations
Figure 3 for Constrained Multi-Slot Optimization for Ranking Recommendations
Figure 4 for Constrained Multi-Slot Optimization for Ranking Recommendations
Viaarxiv icon

Large scale multi-objective optimization: Theoretical and practical challenges

Add code
Feb 13, 2016
Figure 1 for Large scale multi-objective optimization: Theoretical and practical challenges
Figure 2 for Large scale multi-objective optimization: Theoretical and practical challenges
Figure 3 for Large scale multi-objective optimization: Theoretical and practical challenges
Figure 4 for Large scale multi-objective optimization: Theoretical and practical challenges
Viaarxiv icon

The Interplay Between Stability and Regret in Online Learning

Add code
Nov 26, 2012
Viaarxiv icon

Smoothing Multivariate Performance Measures

Add code
Feb 14, 2012
Figure 1 for Smoothing Multivariate Performance Measures
Figure 2 for Smoothing Multivariate Performance Measures
Figure 3 for Smoothing Multivariate Performance Measures
Figure 4 for Smoothing Multivariate Performance Measures
Viaarxiv icon

Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies

Add code
Nov 01, 2010
Figure 1 for Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies
Figure 2 for Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies
Figure 3 for Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies
Figure 4 for Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies
Viaarxiv icon

New Approximation Algorithms for Minimum Enclosing Convex Shapes

Add code
Sep 15, 2010
Figure 1 for New Approximation Algorithms for Minimum Enclosing Convex Shapes
Figure 2 for New Approximation Algorithms for Minimum Enclosing Convex Shapes
Viaarxiv icon

On the Finite Time Convergence of Cyclic Coordinate Descent Methods

Add code
May 12, 2010
Figure 1 for On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Figure 2 for On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Figure 3 for On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Figure 4 for On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Viaarxiv icon

Faster Rates for training Max-Margin Markov Networks

Add code
Mar 06, 2010
Figure 1 for Faster Rates for training Max-Margin Markov Networks
Figure 2 for Faster Rates for training Max-Margin Markov Networks
Figure 3 for Faster Rates for training Max-Margin Markov Networks
Viaarxiv icon

Lower Bounds for BMRM and Faster Rates for Training SVMs

Add code
Sep 08, 2009
Figure 1 for Lower Bounds for BMRM and Faster Rates for Training SVMs
Figure 2 for Lower Bounds for BMRM and Faster Rates for Training SVMs
Figure 3 for Lower Bounds for BMRM and Faster Rates for Training SVMs
Figure 4 for Lower Bounds for BMRM and Faster Rates for Training SVMs
Viaarxiv icon