Cover Image

Snacks: a fast large-scale kernel SVM solver

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tanji, Sofiane, Della Vecchia, Andrea, Glineur, François, Villa, Silvia
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fairness-informed Pareto Optimization : An Efficient Bilevel Framework
by: Tanji, Sofiane, et al.
Published: (2026)

Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
by: Vernimmen, Pierre, et al.
Published: (2025)

Strong bounds for large-scale Minimum Sum-of-Squares Clustering
by: Croella, Anna Livia, et al.
Published: (2025)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
by: Vernimmen, Pierre, et al.
Published: (2025)

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

A practical, fast method for solving sum-of-squares problems for very large polynomials
by: Keren, Daniel, et al.
Published: (2024)

Global minimization of a minimum of a finite collection of functions
by: Van Dessel, Guillaume, et al.
Published: (2024)

Ultra-fast feature learning for the training of two-layer neural networks in the two-timescale regime
by: Barboni, Raphaël, et al.
Published: (2025)

Variance reduction techniques for stochastic proximal point algorithms
by: Traoré, Cheik, et al.
Published: (2023)

Stochastic Zeroth order Descent with Structured Directions
by: Rando, Marco, et al.
Published: (2022)

Iterative regularization in classification via hinge loss diagonal descent
by: Apidopoulos, Vassilis, et al.
Published: (2022)

SGD for Variational Inference: Tackling Unbounded Variance via Preconditioning and Dynamic Batching
by: Labarrière, Hippolyte, et al.
Published: (2026)

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
by: Van Dessel, Guillaume, et al.
Published: (2025)

Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization
by: Coppola, Corrado, et al.
Published: (2024)

PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
by: Goujaud, Baptiste, et al.
Published: (2022)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
by: Iommazzo, Gabriele, et al.
Published: (2024)

Optimization Insights into Deep Diagonal Linear Networks
by: Labarrière, Hippolyte, et al.
Published: (2024)

Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty
by: Van Dessel, Guillaume, et al.
Published: (2025)

Safe exploration in reproducing kernel Hilbert spaces
by: Tokmak, Abdullah, et al.
Published: (2025)

A mixed-categorical correlation kernel for Gaussian process
by: Saves, P., et al.
Published: (2022)

Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search
by: Barnhart, Cynthia, et al.
Published: (2024)

Towards safe Bayesian optimization with Wiener kernel regression
by: Molodchyk, Oleksii, et al.
Published: (2024)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Multi-objective Bayesian Optimization With Mixed-categorical Design Variables for Expensive-to-evaluate Aeronautical Applications
by: Bartoli, Nathalie, et al.
Published: (2025)

ATE-SG: Alternate Through the Epochs Stochastic Gradient for Multi-Task Neural Networks
by: Bellavia, Stefania, et al.
Published: (2023)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, et al.
Published: (2024)

On the Set of Possible Minimizers of a Sum of Convex Functions
by: Zamani, Moslem, et al.
Published: (2024)

Gradient descent in matrix factorization: Understanding large initialization
by: Chen, Hengchao, et al.
Published: (2023)

Alignment of large language models with constrained learning
by: Zhang, Botong, et al.
Published: (2025)

Continuum-marginal optimal transport: a mesh-free kernel method
by: Nakano, Yumiharu
Published: (2026)

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
by: Huang, Yufan, et al.
Published: (2024)

Benchmarking Diffusion Annealing-Based Bayesian Inverse Problem Solvers
by: Crafts, Evan Scope, et al.
Published: (2025)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
by: Rotaru, Teodor, et al.
Published: (2025)

Iteratively reweighted kernel machines efficiently learn sparse functions
by: Zhu, Libin, et al.
Published: (2025)

Robust stabilization of polytopic systems via fast and reliable neural network-based approximations
by: Fabiani, Filippo, et al.
Published: (2022)

Understanding the training of infinitely deep and wide ResNets with Conditional Optimal Transport
by: Barboni, Raphaël, et al.
Published: (2024)