:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Shi, Xinbo, Peng, Yijie, Tuffin, Bruno
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Optimization and Control
Acceso en línea:	https://arxiv.org/abs/2411.10695
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Meta-Learning from Learning Curves for Budget-Limited Algorithm Selection
por: Nguyen, Manh Hung, et al.
Publicado: (2024)

Decision-Aware Predictive Model Selection for Workforce Allocation
por: Stratman, Eric G., et al.
Publicado: (2024)

Optimal Computing Budget Allocation for Data-driven Ranking and Selection
por: Wang, Yuhao, et al.
Publicado: (2022)

Ranking and Selection with Simultaneous Input Data Collection
por: Wang, Yuhao, et al.
Publicado: (2025)

Optimizing Input Data Collection for Ranking and Selection
por: Song, Eunhye, et al.
Publicado: (2025)

Online Resource Allocation with Average Budget Constraints
por: Ao, Ruicheng, et al.
Publicado: (2024)

Accelerating Decentralized Optimization via Overlapping Local Steps
por: Zhou, Yijie, et al.
Publicado: (2026)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
por: Zhou, Yijie, et al.
Publicado: (2025)

Beyond likelihood ratio bias: Nested multi-time-scale stochastic approximation for likelihood-free parameter estimation
por: Li, Zehao, et al.
Publicado: (2024)

Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices
por: Parshakova, Tetiana, et al.
Publicado: (2023)

Stochastic Approximation Methods for Distortion Risk Measure Optimization
por: Jiang, Jinyang, et al.
Publicado: (2025)

Budget-aware Auto Optimizer Configurator
por: Liu, Kang, et al.
Publicado: (2026)

Bi-Sparse Unsupervised Feature Selection
por: Xiu, Xianchao, et al.
Publicado: (2024)

Contextual Bandits with Budgeted Information Reveal
por: Gan, Kyra, et al.
Publicado: (2023)

Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
por: Zhang, Richard Y.
Publicado: (2022)

A Unified Analysis for Finite Weight Averaging
por: Wang, Peng, et al.
Publicado: (2024)

Data-Efficient and Robust Task Selection for Meta-Learning
por: Zhan, Donglin, et al.
Publicado: (2024)

Data Collaboration Analysis with Orthonormal Basis Selection and Alignment
por: Nosaka, Keiyu, et al.
Publicado: (2024)

Mitigating Forgetting in Continual Learning with Selective Gradient Projection
por: Singh, Anika, et al.
Publicado: (2026)

Closing the Loop: Coordinating Inventory and Recommendation via Deep Reinforcement Learning on Multiple Timescales
por: Jiang, Jinyang, et al.
Publicado: (2025)

Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty
por: Lin, Zikun, et al.
Publicado: (2026)

A Budget-Adaptive Allocation Rule for Optimal Computing Budget Allocation
por: Cao, Zirui, et al.
Publicado: (2023)

Separating Geometry from Probability in the Analysis of Generalization
por: Raginsky, Maxim, et al.
Publicado: (2026)

PACSBO: Probably approximately correct safe Bayesian optimization
por: Tokmak, Abdullah, et al.
Publicado: (2024)

Continuous-time q-Learning for Jump-Diffusion Models under Tsallis Entropy
por: Bo, Lijun, et al.
Publicado: (2024)

Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning
por: Zhan, Donglin, et al.
Publicado: (2025)

Enhancing Unsupervised Feature Selection via Double Sparsity Constrained Optimization
por: Xiu, Xianchao, et al.
Publicado: (2025)

Non-Convex Federated Optimization under Cost-Aware Client Selection
por: Jiang, Xiaowen, et al.
Publicado: (2025)

Asynchronous and Stochastic Distributed Resource Allocation
por: Li, Qiang, et al.
Publicado: (2025)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
por: Xu, Yewei, et al.
Publicado: (2026)

Chebyshev Center-Based Direction Selection for Multi-Objective Optimization and Training PINNs
por: Yoon, Hoyeol, et al.
Publicado: (2026)

Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection
por: Zhang, Qixin, et al.
Publicado: (2026)

Risk-Sensitive Q-Learning in Continuous Time with Application to Dynamic Portfolio Selection
por: Xie, Chuhan
Publicado: (2025)

A Reinforcement-Learning-Based Multiple-Column Selection Strategy for Column Generation
por: Yuan, Haofeng, et al.
Publicado: (2023)

Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
por: Liu, Shanqi, et al.
Publicado: (2024)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
por: Garber, Dan, et al.
Publicado: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
por: Garber, Dan, et al.
Publicado: (2022)

Online Resource Allocation with Non-Stationary Customers
por: Zhang, Xiaoyue, et al.
Publicado: (2024)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
por: Cheng, Hongyu, et al.
Publicado: (2024)

Bandit Allocational Instability
por: Chen, Yilun, et al.
Publicado: (2026)