30 articles tagged with #optimal-transport. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers establish a theoretical connection between Generative Flow Networks (GFlowNets) and optimal transport theory, demonstrating that minimum-flow GFlowNets reduce to Kantorovich optimal transport problems. This framework enables GFlowNets to learn optimal transport plans on large graphs through neural parameterization, with experimental validation confirming alignment with exact solvers.
Researchers propose MESA, a new safety alignment framework for Mixture-of-Experts language models that addresses a critical vulnerability where safety capabilities concentrate in few experts. The method uses Optimal Transport theory to strategically distribute safety responsibilities across multiple experts while maintaining model performance and computational efficiency.
Researchers introduce DOT-MoE, a framework that converts dense language models into sparse Mixture-of-Experts architectures using differentiable optimal transport. The method achieves 90% performance retention while reducing active parameters by 50%, addressing a critical bottleneck in LLM inference efficiency without the instability of training MoEs from scratch.
HyperTransport is a new hypernetwork framework that dramatically accelerates activation steering for text-to-image models by amortizing optimization costs across multiple concepts. Rather than optimizing intervention parameters for each new concept (which takes minutes), the system learns to map CLIP embeddings directly to steering parameters in a single forward pass, achieving 3600-7000x speedup while matching per-concept baselines on unseen concepts.
Researchers introduce SelectiveRM, an optimal transport-based framework that improves reward model training for large language models by handling noisy preference data. The approach uses joint consistency discrepancy and partial transport mechanisms to automatically filter out contradictory samples, theoretically optimizing cleaner risk bounds and outperforming existing methods.
Researchers developed a new AI safety attack method using optimal transport theory that achieves 11% higher success rates in bypassing language model safety mechanisms compared to existing approaches. The study reveals that AI safety refusal mechanisms are localized to specific network layers rather than distributed throughout the model, suggesting current alignment methods may be more vulnerable than previously understood.
Researchers introduce CHaRS (Concept Heterogeneity-aware Representation Steering), a new method for controlling large language model behavior that uses optimal transport theory to create context-dependent steering rather than global directions. The approach models representations as Gaussian mixture models and derives input-dependent steering maps, showing improved behavioral control over existing methods.
Researchers introduce Noise-Guided Transport (NGT), a lightweight machine learning method that enables effective imitation learning with minimal expert demonstrations—as few as 20 data samples. The approach frames imitation as an optimal transport problem solved through adversarial training, requiring no pretraining or specialized hardware while achieving strong performance on complex control tasks.
Researchers propose a novel framework for detecting Advanced Persistent Threats (APTs) across different operating systems without labeled target data, using semantic embeddings and Optimal Transport theory. The source-only approach combines language models, graph autoencoders, and transport-based anomaly scoring to identify malicious processes in cross-OS environments, demonstrating improved detection performance across Linux, Windows, BSD, and Android platforms.
RadOT-Eval is a new AI framework that uses optimal transport algorithms to automatically evaluate radiology report generation by decomposing reports into structured clinical evidence units and detecting specific error types like omissions, hallucinations, and polarity reversals. The method achieves higher correlation with clinician-annotated errors than existing metrics and LLM-based evaluators, providing an auditable approach for quality assurance in high-stakes medical AI applications.
A new mathematical framework establishes minimax rates for predicting future probability distributions in Wasserstein space based on noisy observations of smoothly-varying curves. The research provides both lower bounds and conditional upper bounds for distribution estimation, revealing how prediction accuracy degrades with dimensionality and unobserved future time horizons.
Researchers propose EBiEOT, a novel semi-supervised learning framework that leverages both paired and unpaired data through likelihood maximization and inverse entropic optimal transport. The method demonstrates universal approximation properties and provides an end-to-end algorithm for learning conditional distributions, with potential applications in domain translation and other data-scarce scenarios.
Researchers propose PIBO, a Permutation-Invariant Bayesian Optimization approach that leverages Optimal Transport theory to optimize offshore wind farm layouts. The method exploits the symmetry inherent in wind turbine placement problems where order doesn't matter, achieving superior layouts while reducing computation time by approximately 50% compared to standard Bayesian Optimization.
Researchers identify a fundamental mismatch between pairwise ranking metrics (AP and FPR-95) commonly used to evaluate multi-view object association models and the actual one-to-one assignment objective these systems aim to solve. The study demonstrates that optimal ranking performance does not guarantee correct assignments, and proposes Sinkhorn-based normalization as a solution to better align evaluation metrics with real-world performance goals.
Researchers introduce an active learning framework for inferring continuous probability distributions from sparse data snapshots, addressing a key challenge in fields like single-cell biology where data collection is destructive and expensive. The method uses Linearized Optimal Transport to map probability distributions into a space suitable for Gaussian Process modeling, enabling uncertainty-guided selection of optimal measurement times.
Researchers propose Supervised Distributional Reduction (SDR), a machine learning algorithm combining optimal transport theory with dependence maximization to create compact data representations that preserve both geometric structure and predictive information. The method extends the Fused Gromov-Wasserstein framework and offers applications in representation learning and adaptive kernel design for Gaussian Process modeling.
A comprehensive academic survey examines how optimal transport and diffusion methods provide unified mathematical frameworks for solving machine learning problems involving time-evolving probability distributions. The research highlights applications across generative AI, neural network optimization, and large language model dynamics, offering computational and theoretical advantages through Lagrangian vector field representations.
Researchers propose Structure-Centric Graph Foundation Models (SCGFM), a novel approach that treats graph topology as the primary source of transferable knowledge using geometric bases and Gromov-Wasserstein distances. The method addresses key limitations in existing graph foundation models by handling structural heterogeneity and incompatible node feature spaces, demonstrating improved generalization across both in-domain and cross-domain graph tasks.
Researchers introduce cuRegOT, a GPU-accelerated solver that significantly improves the speed of entropic-regularized optimal transport computations through algorithmic optimizations like amortized symbolic analysis and fused kernels. The breakthrough addresses a critical computational bottleneck in machine learning by outperforming existing GPU-based solvers while maintaining theoretical convergence guarantees.
Researchers have developed OT-Bridge Editor, an AI method that uses optimal transport theory to synthesize realistic coronary angiography images with artificial stenosis lesions. The technique achieves 27.8% improvement in stenosis detection performance on benchmark datasets, addressing the critical shortage of high-quality medical imaging training data.
Researchers introduce Neural CFRS, a non-autoregressive neural network framework that solves the Capacitated Vehicle Routing Problem by clustering nodes first, then routing—departing from sequential autoregressive methods. The approach uses differentiable optimal transport to enforce capacity constraints and achieves competitive results on benchmarks while scaling robustly to large, out-of-distribution instances.
Researchers propose using conditional optimal transport to improve calibration of Process Reward Models (PRMs) used in AI inference-time scaling, addressing the problem of overestimated success probabilities. The method enables better confidence bounds for mathematical reasoning tasks and improves downstream performance in Best-of-N selection frameworks.
Researchers introduce PLOT (Progressive Localization via Optimal Transport), a new framework for mechanistic interpretability that efficiently identifies causal variables in neural networks through optimal transport coupling rather than computationally expensive searches. The method significantly speeds up causal abstraction analysis while maintaining competitive accuracy, offering practical advantages for large-scale AI interpretability research.
Researchers introduce Mean-Field Path-Integral Diffusion (MF-PID), a novel framework where generative model samples interact as coordinated agents rather than operating independently, achieving significant efficiency gains in probability transport. The approach unifies generative modeling with multi-agent control theory and demonstrates 19-24% energy reduction in demand-response applications while maintaining exact terminal distribution matching.
Researchers introduce Hyperparameter Trajectory Inference (HTI), a method to predict how neural networks behave with different hyperparameter settings without expensive retraining. The approach uses conditional Lagrangian optimal transport to create surrogate models that approximate neural network outputs across various hyperparameter configurations.
