Imagen de Portada

Sparse Submodular Function Minimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Graur, Andrei, Jiang, Haotian, Sidford, Aaron
Formato:	Preprint
Publicado:	2023
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

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

On computing approximate Lewis weights
por: Apers, Simon, et al.
Publicado: (2024)

Entropy Regularization and Faster Decremental Matching in General Graphs
por: Chen, Jiale, et al.
Publicado: (2023)

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

Convex optimization with $p$-norm oracles
por: Adil, Deeksha, et al.
Publicado: (2024)

Reusing Samples in Variance Reduction
por: Jin, Yujia, et al.
Publicado: (2025)

Quantum speedups for stochastic optimization
por: Sidford, Aaron, et al.
Publicado: (2023)

Extracting Dual Solutions via Primal Optimizers
por: Carmon, Yair, et al.
Publicado: (2024)

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

Submodular Order Functions and Assortment Optimization
por: Udwani, Rajan
Publicado: (2021)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
por: Jambulapati, Arun, et al.
Publicado: (2024)

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

Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
por: Dereziński, Michał, et al.
Publicado: (2025)

Truncated Variance Reduced Value Iteration
por: Jin, Yujia, et al.
Publicado: (2024)

Solving Matrix Games with Near-Optimal Matvec Complexity
por: Karmarkar, Ishani, et al.
Publicado: (2026)

Solving Zero-Sum Games with Fewer Matrix-Vector Products
por: Karmarkar, Ishani, et al.
Publicado: (2025)

Difference of Submodular Minimization via DC Programming
por: Halabi, Marwa El, et al.
Publicado: (2023)

Efficient Convex Optimization Requires Superlinear Memory
por: Marsden, Annie, et al.
Publicado: (2022)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
por: Liu, Yang P., et al.
Publicado: (2025)

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

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
por: Wang, Chenhao
Publicado: (2025)

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

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
por: Amanatidis, Georgios, et al.
Publicado: (2024)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
por: Chen, Shengminjie, et al.
Publicado: (2026)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
por: Adil, Deeksha, et al.
Publicado: (2024)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
por: Hu, Hins, et al.
Publicado: (2025)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
por: Zhang, Hongyang R., et al.
Publicado: (2023)

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

Combinatorial Sparse PCA Beyond the Spiked Identity Model
por: Kumar, Syamantak, et al.
Publicado: (2026)

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

Labeling Methods for Partially Ordered Paths
por: Euler, Ricardo, et al.
Publicado: (2023)

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

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2023)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
por: Balseiro, Santiago R., et al.
Publicado: (2023)

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

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
por: Bhimaraju, Akhil, et al.
Publicado: (2023)

Parameterized algorithms for block-structured integer programs with large entries
por: Cslovjecsek, Jana, et al.
Publicado: (2023)

When Location Shapes Choice: Placement Optimization of Substitutable Products
por: Housni, Omar El, et al.
Publicado: (2023)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
por: Kasperski, Adam, et al.
Publicado: (2024)