Copertina

Adaptive Risk Mitigation in Demand Learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Pakiman, Parshan, Chen, Boxiao, Nadarajah, Selvaprabu, Jasin, Stefanus
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Machine Learning Information Retrieval 90B50, 90C15, 68Q32
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

FSD-CAP: Fractional Subgraph Diffusion with Class-Aware Propagation for Graph Feature Imputation
di: Qiao, Xin, et al.
Pubblicazione: (2026)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
di: Azizian, Waïss, et al.
Pubblicazione: (2025)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
di: Petrov, Petar P.
Pubblicazione: (2022)

A Theoretical Study of (Hyper) Self-Attention through the Lens of Interactions: Representation, Training, Generalization
di: Ustaomeroglu, Muhammed, et al.
Pubblicazione: (2025)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
di: Azizian, Waïss, et al.
Pubblicazione: (2024)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
di: Ye, Yuhan, et al.
Pubblicazione: (2026)

Online Decision Making with Generative Action Sets
di: Xu, Jianyu, et al.
Pubblicazione: (2025)

Learning Decision-Sufficient Representations for Linear Optimization
di: Ye, Yuhan, et al.
Pubblicazione: (2026)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
di: Azizian, Waïss, et al.
Pubblicazione: (2022)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
di: Chiarelli, Nina, et al.
Pubblicazione: (2023)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
di: Chu, Hong T. M.
Pubblicazione: (2026)

Reallocating and Sharing Health Equipments in Sanitary Emergency Situations: The COVID-19 Case in Spain
di: Blanco, Víctor, et al.
Pubblicazione: (2020)

Policy Optimization over General State and Action Spaces
di: Ju, Caleb, et al.
Pubblicazione: (2022)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
di: Roith, Tim, et al.
Pubblicazione: (2025)

Topological structure and a polynomial-time solution of linear programming over the real numbers
di: Wei, Jing-Yuan
Pubblicazione: (2018)

A non-iterative polynomial algorithm for linear programming
di: Jing-Yuan, Wei
Pubblicazione: (2013)

Tensors, entanglement, separability, and their complexity
di: Friedland, Shmuel
Pubblicazione: (2025)

Blended Conditional Gradients: the unconditioning of conditional gradients
di: Braun, Gábor, et al.
Pubblicazione: (2018)

Attempting the impossible: enumerating extremal submodular functions for n=6
di: Csirmaz, Elod P., et al.
Pubblicazione: (2024)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
di: Katende, Ronald
Pubblicazione: (2026)

Multi-objective stochastic linear programming with recourse and flexible decision making
di: Hamel, Andreas H., et al.
Pubblicazione: (2024)

Worst-Case Learning under a Multi-fidelity Model
di: Foucart, Simon, et al.
Pubblicazione: (2024)

Modern column generation for estimating single- and multi-purchase ranked list choice models
di: Costa, Luciano, et al.
Pubblicazione: (2026)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
di: Friedland, Shmuel
Pubblicazione: (2023)

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

Beyond Discreteness: Sample Complexity Analysis of Straight-Through Estimator for 1-bit Quantization
di: Jeong, Halyun, et al.
Pubblicazione: (2025)

SAGE: Sign-Adaptive Gradient for Memory-Efficient LLM Optimization
di: Lee, Wooin, et al.
Pubblicazione: (2026)

Efficient Learning for Entropy-Regularized Markov Decision Processes via Multilevel Monte Carlo
di: Meunier, Matthieu, et al.
Pubblicazione: (2025)

Centrality measures and opinion dynamics in two-layer networks with replica nodes
di: Zhao, Chi, et al.
Pubblicazione: (2024)

A semidefinite programming characterization of the Crawford number
di: Friedland, Shmuel, et al.
Pubblicazione: (2024)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
di: Sun, Tianxiao, et al.
Pubblicazione: (2026)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
di: Yan, Chen, et al.
Pubblicazione: (2024)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
di: Condat, Laurent, et al.
Pubblicazione: (2022)

Optimizing Travel Time and Regenerative Energy for Periodic Timetables
di: Roth, Sarah, et al.
Pubblicazione: (2026)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
di: Robertson, Sawyer Jack, et al.
Pubblicazione: (2025)

Black-Box Uniform Stability for Non-Euclidean Empirical Risk Minimization
di: Vary, Simon, et al.
Pubblicazione: (2024)

Analysis of Kernel Mirror Prox for Measure Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Online Convex Optimization Using Coordinate Descent Algorithms
di: Lin, Yankai, et al.
Pubblicazione: (2022)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
di: Wu, Hanju, et al.
Pubblicazione: (2025)