The following pages link to Francis Bach (Q252245):
Displaying 50 items.
- (Q309705) (redirect page) (← links)
- Nonparametric stochastic approximation with large step-sizes (Q309706) (← links)
- (Q517294) (redirect page) (← links)
- Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
- Erratum to: ``Minimizing finite sums with the stochastic average gradient'' (Q517296) (← links)
- (Q589866) (redirect page) (← links)
- Slice inverse regression with score functions (Q1753150) (← links)
- Self-concordant analysis for logistic regression (Q1952060) (← links)
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching (Q2039235) (← links)
- The recursive variational Gaussian approximation (R-VGA) (Q2066753) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives (Q2165600) (← links)
- Bridging the gap between constant step size stochastic gradient descent and Markov chains (Q2196224) (← links)
- Finite-sample analysis of \(M\)-estimators using self-concordance (Q2219231) (← links)
- Regularized nonlinear acceleration (Q2288185) (← links)
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance (Q2325336) (← links)
- Kernel dimension reduction in regression (Q2388983) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- Sparse Modeling for Image and Vision Processing (Q2799519) (← links)
- (Q2880898) (← links)
- (Q2896018) (← links)
- Optimization with Sparsity-Inducing Penalties (Q2903300) (← links)
- Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression (Q2934003) (← links)
- Duality Between Subgradient and Conditional Gradient Methods (Q2954379) (← links)
- Sparse and Spurious: Dictionary Learning With Noise and Outliers (Q2977139) (← links)
- Sample Complexity of Dictionary Learning and Other Matrix Factorizations (Q2978588) (← links)
- 10.1162/153244303768966085 (Q3044131) (← links)
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices (Q3083289) (← links)
- (Q3093182) (← links)
- (Q3096144) (← links)
- (Q3096148) (← links)
- (Q3096204) (← links)
- (Q3174019) (← links)
- (Q3174030) (← links)
- (Q3174083) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- (Q3464598) (← links)
- Learning the Structure for Structured Sparsity (Q4580804) (← links)
- (Q4636989) (← links)
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression (Q4637017) (← links)
- (Q4637051) (← links)
- Active-set Methods for Submodular Minimization Problems (Q4637060) (← links)
- 10.1162/jmlr.2003.4.7-8.1205 (Q4669448) (← links)
- Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity (Q4902145) (← links)
- On the Effectiveness of Richardson Extrapolation in Data Science (Q5018900) (← links)
- (Q5047194) (← links)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (Q5214253) (← links)
- Sparse Recovery and Dictionary Learning From Nonlinear Compressive Measurements (Q5240566) (← links)
- (Q5269978) (← links)
