Imagen de Portada

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Yang P., Peng, Richard, Tang, Colin, Weng, Albert, Yang, Junzhao
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Importance Sparsification for Sinkhorn Algorithm
por: Li, Mengyu, et al.
Publicado: (2023)

Sparse Submodular Function Minimization
por: Graur, Andrei, et al.
Publicado: (2023)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
por: Gu, Yuzhou, et al.
Publicado: (2023)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets
por: Liu, Yang P., et al.
Publicado: (2025)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
por: Chen, Shengminjie, et al.
Publicado: (2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
por: Cole, Richard, et al.
Publicado: (2023)

Discrete and Continuous Difference of Submodular Minimization
por: Orfanides, George, et al.
Publicado: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
por: Wang, Hao, et al.
Publicado: (2024)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
por: Cai, Xufeng, et al.
Publicado: (2025)

Learning-Augmented Algorithms for the Bahncard Problem
por: Zhao, Hailiang, et al.
Publicado: (2024)

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
por: Kerimov, Süleyman, et al.
Publicado: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)

Generalized Assignment and Knapsack Problems in the Random-Order Model
por: Klimm, Max, et al.
Publicado: (2025)

Radial Isotropic Position via an Implicit Newton's Method
por: Jambulapati, Arun, et al.
Publicado: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
por: Adil, Deeksha, et al.
Publicado: (2025)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
por: Xie, Fangzhou
Publicado: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
por: Ma, Zihang
Publicado: (2025)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
por: Anapolska, Mariia, et al.
Publicado: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
por: Objois, Étienne, et al.
Publicado: (2025)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
por: Bhandari, Swastik
Publicado: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
por: Segev, Danny, et al.
Publicado: (2025)

Robust Gittins for Stochastic Scheduling
por: Moseley, Benjamin, et al.
Publicado: (2025)

Is Zadeh's Least-Entered Pivot Rule Exponential?
por: Zadeh, Norman
Publicado: (2025)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
por: Rohwedder, Lars, et al.
Publicado: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
por: Ene, Alina, et al.
Publicado: (2025)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
por: Brubaker, Kyle, et al.
Publicado: (2025)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
Publicado: (2025)

Bayesian Optimal Stopping with Maximum Value Knowledge
por: Kleer, Pieter, et al.
Publicado: (2025)

Sum-Of-Squares To Approximate Knapsack
por: Kothari, Pravesh K., et al.
Publicado: (2025)

Isotropic Noise in Stochastic and Quantum Convex Optimization
por: Marsden, Annie, et al.
Publicado: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
por: Xu, Pan
Publicado: (2025)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

Quasi-Self-Concordant Optimization with Lewis Weights
por: Ene, Alina, et al.
Publicado: (2025)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
por: Yamanaka, Toshiaki
Publicado: (2025)

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
por: Vladu, Adrian
Publicado: (2025)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
por: Chen, Li, et al.
Publicado: (2025)

Assortment optimization given basket shopping behavior using the Ising model
por: Vasilyev, Andrey, et al.
Publicado: (2025)