| Publication | Date of Publication | Type |
|---|
Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
| 2023-10-17 | Paper |
Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
Optimization Methods & Software | 2022-10-06 | Paper |
scientific article; zbMATH DE number 7415112 (Why is no real title available?)
| 2021-10-27 | Paper |
Hybrid safe-strong rules for efficient optimization in Lasso-type problems
Computational Statistics and Data Analysis | 2021-05-07 | Paper |
A data efficient and feasible level set method for stochastic convex optimization with expectation constraints
| 2020-10-05 | Paper |
High-dimensional model recovery from random sketched data by exploring intrinsic sparsity
Machine Learning | 2020-07-27 | Paper |
scientific article; zbMATH DE number 7164697 (Why is no real title available?)
| 2020-02-07 | Paper |
Accelerate stochastic subgradient method by leveraging local growth condition
Analysis and Applications | 2019-10-10 | Paper |
A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints
| 2019-08-07 | Paper |
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints
| 2019-08-05 | Paper |
A simple homotopy proximal mapping algorithm for compressive sensing
Machine Learning | 2019-06-26 | Paper |
Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems
| 2019-02-20 | Paper |
On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Optimization
| 2019-01-30 | Paper |
RSG: Beating Subgradient Method without Smoothness and Strong Convexity
| 2018-11-21 | Paper |
First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problems
| 2018-10-24 | Paper |
Frank-Wolfe Method is Automatically Adaptive to Error Bound Condition
| 2018-10-10 | Paper |
Katalyst: Boosting Convex Katayusha for Non-Convex Problems with a Large Condition Number
| 2018-09-18 | Paper |
Distributed stochastic variance reduced gradient methods by sampling extra data with replacement
| 2018-04-17 | Paper |
Improved Bounds for the Nyström Method With Application to Kernel Classification
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Random Projections for Classification: A Recovery Approach
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
Lecture Notes in Computer Science | 2016-11-09 | Paper |
On data preconditioning for regularized loss minimization
Machine Learning | 2016-05-19 | Paper |
An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection
| 2015-05-04 | Paper |
An efficient primal dual prox method for non-smooth optimization
Machine Learning | 2015-04-14 | Paper |
Regret bounded by gradual variation for online convex optimization
Machine Learning | 2014-07-14 | Paper |
Trading regret for efficiency: online convex optimization with long term constraints
| 2014-04-01 | Paper |
Online multiple kernel classification
Machine Learning | 2013-03-28 | Paper |
Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
Machine Learning | 2012-05-08 | Paper |
Online multiple kernel learning: algorithms and mistake bounds
Lecture Notes in Computer Science | 2010-10-01 | Paper |
