Copertina

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Harris, Elizabeth, Eshragh, Ali, Lamichhane, Bishnu, Shaw-Carmody, Jordan, Stojanovski, Elizabeth
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Computation 62K05, 62-06, 90-08, 90C25, 90C59
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

Optimal Dorfman Group Testing for Symmetric Distributions
di: Landolfi, Nicholas C., et al.
Pubblicazione: (2023)

Bayesian Multi-Topology Express Transportation Network Design under Posterior Predictive Demand, Sorting-Efficiency and Delivery-Time Uncertainty
di: Chatterjee, Debashis
Pubblicazione: (2026)

Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
di: Chen, Zhongzhu, et al.
Pubblicazione: (2023)

On robust recovery of signals from indirect observations
di: Bekri, Yannis, et al.
Pubblicazione: (2025)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

Metaheuristic algorithms for the induced P-median problem with upgrades
di: Salazar, Sergio, et al.
Pubblicazione: (2026)

Identifiable Convex-Concave Regression via Sub-gradient Regularised Least Squares
di: Chung, William
Pubblicazione: (2025)

Machine Learning-Based Model for Postoperative Stroke Prediction in Coronary Artery Disease
di: Pan, Haonan, et al.
Pubblicazione: (2025)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

Removal of Redundant Candidate Points for the Exact D-Optimal Design Problem
di: Harman, Radoslav, et al.
Pubblicazione: (2025)

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
di: Heinz, Vilém, et al.
Pubblicazione: (2025)

Almost Orthogonal Arrays: Search Three Ways
di: Martínez, Luis, et al.
Pubblicazione: (2024)

Break recovery in graphical networks with D-trace loss
di: Lin, Ying, et al.
Pubblicazione: (2024)

Mixed-integer linear programming for computing optimal experimental designs
di: Harman, Radoslav, et al.
Pubblicazione: (2023)

Inference for max-linear Bayesian networks with noise
di: Adams, Mark, et al.
Pubblicazione: (2025)

Corrected Correlation Estimates for Meta-Analysis
di: Johnson-Vázquez, Alexander, et al.
Pubblicazione: (2024)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
di: Azuma, Godai, et al.
Pubblicazione: (2025)

Regularized Rényi divergence minimization through Bregman proximal gradient algorithms
di: Guilmeau, Thomas, et al.
Pubblicazione: (2022)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Measure This, Not That: Optimizing the Cost and Model-Based Information Content of Measurements
di: Wang, Jialu, et al.
Pubblicazione: (2024)

Low Rank Convex Clustering For Matrix-Valued Observations
di: Lin, Meixia, et al.
Pubblicazione: (2024)

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization
di: Carciaghi, Francesco, et al.
Pubblicazione: (2024)

Iterative Exploration-Driven Sparse SDP Clustering via Thompson Sampling
di: Mun, Jongmin, et al.
Pubblicazione: (2025)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Developing heuristic solution techniques for large-scale unit commitment models
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

Continuity of Filters for Discrete-Time Control Problems Defined by Explicit Equations
di: Feinberg, Eugene A., et al.
Pubblicazione: (2023)

Unbalanced Kantorovich-Rubinstein distance, plan, and barycenter on finite spaces: A statistical perspective
di: Hundrieser, Shayan, et al.
Pubblicazione: (2022)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
di: de Roux, Daniel, et al.
Pubblicazione: (2025)

A Successive Refinement Algorithm for Tri-Level Stochastic Defender-Attacker Problems with Decision-Dependent Probability Distributions
di: Affar, Samuel, et al.
Pubblicazione: (2024)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
di: Dörfler, Daniel, et al.
Pubblicazione: (2026)

Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
di: McRae, Andrew D.
Pubblicazione: (2024)

Don't Look Back in Anger: Wasserstein Distributionally Robust Optimization with Nonstationary Data
di: Keehan, Dominic S. T., et al.
Pubblicazione: (2025)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
di: Hoogervorst, Rowan, et al.
Pubblicazione: (2024)

Can Synthetic Data Improve Symbolic Regression Extrapolation Performance?
di: Ramlan, Fitria Wulandari, et al.
Pubblicazione: (2025)

Forecasting the U.S. Treasury Yield Curve: A Distributionally Robust Machine Learning Approach
di: Liu, Jinjun, et al.
Pubblicazione: (2026)

Applying Data Driven Decision Making to rank Vocational and Educational Training Programs with TOPSIS
di: Conejero, J. M., et al.
Pubblicazione: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)