Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization

• URL: http://arxiv.org/abs/2509.17405v2
• Date: Tue, 23 Sep 2025 06:27:38 GMT
• Title: Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization
• Authors: Manish Acharya, David Hyde,
• Abstract summary: Recent work shows that quasi-Monte Carlo constructions for computing QSW yield direction sets with excellent approximation error.<n>This paper presents an alternate, novel approach: learning directions with Bayesian optimization (BO)<n>We introduce a family of drop-in selectors for projection directions: BOSW, RBOSW, ABOSW, and ARBOSW.<n>We find that ABOSW and ARBOSW can achieve convergence comparable to the best QSW variants with modest runtime overhead.
• Score: 0.2891910035195719
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The sliced Wasserstein distance (SW) reduces optimal transport on $\mathbb{R}^d$ to a sum of one-dimensional projections, and thanks to this efficiency, it is widely used in geometry, generative modeling, and registration tasks. Recent work shows that quasi-Monte Carlo constructions for computing SW (QSW) yield direction sets with excellent approximation error. This paper presents an alternate, novel approach: learning directions with Bayesian optimization (BO), particularly in settings where SW appears inside an optimization loop (e.g., gradient flows). We introduce a family of drop-in selectors for projection directions: BOSW, a one-shot BO scheme on the unit sphere; RBOSW, a periodic-refresh variant; ABOSW, an adaptive hybrid that seeds from competitive QSW sets and performs a few lightweight BO refinements; and ARBOSW, a restarted hybrid that periodically relearns directions during optimization. Our BO approaches can be composed with QSW and its variants (demonstrated by ABOSW/ARBOSW) and require no changes to downstream losses or gradients. We provide numerical experiments where our methods achieve state-of-the-art performance, and on the experimental suite of the original QSW paper, we find that ABOSW and ARBOSW can achieve convergence comparable to the best QSW variants with modest runtime overhead.

Related papers

• VBO-MI: A Fully Gradient-Based Bayesian Optimization Framework Using Variational Mutual Information Estimation [1.0829694003408499]
  VBO-MI is a fully gradient-based BO framework that leverages recent advances in variational mutual information estimation.<n>We evaluate our method on a diverse suite of benchmarks, including high-dimensional synthetic functions and complex real-world tasks.
  arXiv  Detail & Related papers  (2026-01-13T03:07:52Z)
• Neural Nonmyopic Bayesian Optimization in Dynamic Cost Settings [73.44599934855067]
  LookaHES is a nonmyopic BO framework designed for dynamic, history-dependent cost environments.<n>LookaHES combines a multi-step variant of $H$-Entropy Search with pathwise sampling and neural policy optimization.<n>Our innovation is the integration of neural policies, including large language models, to effectively navigate structured, domain-specific action spaces.
  arXiv  Detail & Related papers  (2026-01-10T09:49:45Z)
• Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization [0.9303501974597549]
  We investigate nonlinear dimensionality reduction techniques that reduce the problem to a sequence of low-dimensional Latent-Space BO (LSBO)<n>We propose some changes in their implementation, originally designed for tasks such as molecule generation, and reformulate the algorithm for broader optimisation purposes.<n>We then couple LSBO with Sequential Domain Reduction (SDR) directly in the latent space (SDR-LSBO), yielding an algorithm that narrows the latent search domains as evidence accumulates.
  arXiv  Detail & Related papers  (2025-10-17T08:45:38Z)
• A Gradient Meta-Learning Joint Optimization for Beamforming and Antenna Position in Pinching-Antenna Systems [63.213207442368294]
  We consider a novel optimization design for multi-waveguide pinching-antenna systems.<n>The proposed GML-JO algorithm is robust to different choices and better performance compared with the existing optimization methods.
  arXiv  Detail & Related papers  (2025-06-14T17:35:27Z)
• Dimensionality Reduction Techniques for Global Bayesian Optimisation [1.433758865948252]
  We explore Latent Space Bayesian optimisation, that applies dimensionality reduction to perform BO in a reduced-dimensional subspace.<n>We employ Variational Autoencoders (VAEs) to manage more complex data structures and general DR tasks.<n>We suggest a few key corrections in their implementation, originally designed for tasks such as molecule generation, and reformulate the algorithm for broader optimisation purposes.
  arXiv  Detail & Related papers  (2024-12-12T11:27:27Z)
• Sample-efficient Bayesian Optimisation Using Known Invariances [56.34916328814857]
  We show that vanilla and constrained BO algorithms are inefficient when optimising invariant objectives. We derive a bound on the maximum information gain of these invariant kernels. We use our method to design a current drive system for a nuclear fusion reactor, finding a high-performance solution.
  arXiv  Detail & Related papers  (2024-10-22T12:51:46Z)
• Bayesian Experimental Design via Contrastive Diffusions [2.2186678387006435]
  Experimental Design (BOED) is a powerful tool to reduce the cost of running a sequence of experiments.<n>We introduce a pooled gradient distribution with cost-effective sampling properties and provide a tractable access to the EIG contrast posterior via a new EIG expression.<n>By incorporating generative models into the BOED framework, we expand its scope and its use in scenarios that were impractical.
  arXiv  Detail & Related papers  (2024-10-15T17:53:07Z)
• Light and Optimal Schrödinger Bridge Matching [67.93806073192938]
  We propose a novel procedure to learn Schr"odinger Bridges (SB) which we call the textbf Schr"odinger bridge matching. We show that the optimal bridge matching objective coincides with the recently discovered energy-based modeling (EBM) objectives to learn EOT/SB. We develop a light solver (which we call LightSB-M) to implement optimal matching in practice using the mixture parameterization of the Schr"odinger potential.
  arXiv  Detail & Related papers  (2024-02-05T17:17:57Z)
• Poisson Process for Bayesian Optimization [126.51200593377739]
  We propose a ranking-based surrogate model based on the Poisson process and introduce an efficient BO framework, namely Poisson Process Bayesian Optimization (PoPBO) Compared to the classic GP-BO method, our PoPBO has lower costs and better robustness to noise, which is verified by abundant experiments.
  arXiv  Detail & Related papers  (2024-02-05T02:54:50Z)
• Parallel Bayesian Optimization Using Satisficing Thompson Sampling for Time-Sensitive Black-Box Optimization [0.0]
  We propose satisficing Thompson sampling-based parallel BO approaches, including synchronous and asynchronous versions. We shift the target from an optimal solution to a satisficing solution that is easier to learn. The effectiveness of the proposed methods is demonstrated on a fast-charging design problem of Lithium-ion batteries.
  arXiv  Detail & Related papers  (2023-10-19T07:03:51Z)
• Energy-Guided Continuous Entropic Barycenter Estimation for General Costs [95.33926437521046]
  We propose a novel algorithm for approximating the continuous Entropic OT (EOT) barycenter for arbitrary OT cost functions.<n>Our approach is built upon the dual reformulation of the EOT problem based on weak OT.
  arXiv  Detail & Related papers  (2023-10-02T11:24:36Z)
• Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation [84.0621253654014]
  We propose a framework, called BALLET, which adaptively filters for a high-confidence region of interest. We show theoretically that BALLET can efficiently shrink the search space, and can exhibit a tighter regret bound than standard BO.
  arXiv  Detail & Related papers  (2023-07-25T09:45:47Z)
• Bayesian Optimization-Based Beam Alignment for MmWave MIMO Communication Systems [1.7467279441152421]
  beam alignment (BA) is a critical issue in millimeter wave communication (mmWave) We present a novel beam alignment scheme on the basis of a machine learning strategy, Bayesian optimization (BO) In this work, we consider the beam alignment issue to be a black box function and then use BO to find the possible optimal beam pair.
  arXiv  Detail & Related papers  (2022-07-28T15:37:49Z)
• LinEasyBO: Scalable Bayesian Optimization Approach for Analog Circuit Synthesis via One-Dimensional Subspaces [11.64233949999656]
  We propose a fast and robust Bayesian optimization approach via one-dimensional subspaces for analog circuit synthesis. Our proposed algorithm can accelerate the optimization procedure by up to 9x and 38x compared to LP-EI and REMBOpBO respectively when the batch size is 15.
  arXiv  Detail & Related papers  (2021-09-01T21:25:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.