Cover Image

Latent Guided Sampling for Combinatorial Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Surendran, Sobihan, Fermanian, Adeline, Corff, Sylvain Le
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-asymptotic Analysis of Biased Adaptive Stochastic Approximation
by: Surendran, Sobihan, et al.
Published: (2024)

Multivariate Online Linear Regression for Hierarchical Forecasting
by: Hihat, Massil, et al.
Published: (2024)

Theoretical Convergence Guarantees for Variational Autoencoders
by: Surendran, Sobihan, et al.
Published: (2024)

Online Policy Selection for Inventory Problems
by: Hihat, Massil, et al.
Published: (2024)

Reheated Gradient-based Discrete Sampling for Combinatorial Optimization
by: Li, Muheng, et al.
Published: (2025)

TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization
by: Sorokin, D., et al.
Published: (2023)

Combinatorial Optimization Augmented Machine Learning
by: Schiffer, Maximilian, et al.
Published: (2026)

Pointer Networks with Q-Learning for Combinatorial Optimization
by: Barro, Alessandro
Published: (2023)

Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update
by: Pugacheva, Daria, et al.
Published: (2024)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
by: Lodi, Andrea, et al.
Published: (2019)

Wasserstein Convergence of Critically Damped Langevin Diffusions
by: Strasman, Stanislas, et al.
Published: (2025)

Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
by: Bu, Fanchen, et al.
Published: (2024)

Neural Solver Selection for Combinatorial Optimization
by: Gao, Chengrui, et al.
Published: (2024)

Heuristics for Combinatorial Optimization via Value-based Reinforcement Learning: A Unified Framework and Analysis
by: Davidovich, Orit, et al.
Published: (2025)

Proximal Oracles for Optimization and Sampling
by: Liang, Jiaming, et al.
Published: (2024)

Optimizing Posterior Samples for Bayesian Optimization via Rootfinding
by: Adebiyi, Taiwo A., et al.
Published: (2024)

Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems
by: Hu, Chenchuhui
Published: (2024)

High-Dimensional Bayesian Optimization Using Both Random and Supervised Embeddings
by: Priem, Rémy, et al.
Published: (2025)

Progressively Sampled Equality-Constrained Optimization
by: Curtis, Frank E., et al.
Published: (2025)

Structured Reinforcement Learning for Combinatorial Decision-Making
by: Hoppe, Heiko, et al.
Published: (2025)

Imitation Learning for Combinatorial Optimisation under Uncertainty
by: Gawas, Prakash, et al.
Published: (2026)

Unbiased Single-Queried Gradient for Combinatorial Objective
by: Sornwanee, Thanawat
Published: (2026)

Combinatorial Causal Bandits without Graph Skeleton
by: Feng, Shi, et al.
Published: (2023)

Sample Complexity of Stochastic Optimization with Integer Variables
by: Cheng, Hongyu, et al.
Published: (2026)

Epsilon-Greedy Thompson Sampling to Bayesian Optimization
by: Do, Bach, et al.
Published: (2024)

Group Distributionally Robust Optimization with Flexible Sample Queries
by: Bai, Haomin, et al.
Published: (2025)

The Sample Complexity of Parameter-Free Stochastic Convex Optimization
by: Lawrence, Jared, et al.
Published: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Going from a Representative Agent to Counterfactuals in Combinatorial Choice
by: Ruan, Yanqiu, et al.
Published: (2025)

Stein Boltzmann Sampling: A Variational Approach for Global Optimization
by: Serré, Gaëtan, et al.
Published: (2024)

Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
by: Smit, Igor G., et al.
Published: (2024)

Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling
by: Li, Junyi, et al.
Published: (2024)

Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization
by: Yang, Yufeng, et al.
Published: (2024)

Unsupervised Training of Diffusion Models for Feasible Solution Generation in Neural Combinatorial Optimization
by: Hong, Seong-Hyun, et al.
Published: (2024)

Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime
by: Geng, Haoyu, et al.
Published: (2023)

Towards Guided Descent: Optimization Algorithms for Training Neural Networks At Scale
by: Nagwekar, Ansh
Published: (2025)

A Global Optimization Algorithm for K-Center Clustering of One Billion Samples
by: Ren, Jiayang, et al.
Published: (2022)

Zero-Order Optimization for LLM Fine-Tuning via Learnable Direction Sampling
by: Parfenov, Valery, et al.
Published: (2026)

A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization
by: Nath, Ankur, et al.
Published: (2024)

Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method
by: Liang, Jiaming
Published: (2024)