On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

count % of corpus

6 results for “fixed-support”

Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithmcs.CC

Study on Wasserstein barycenters with computational hardness and fast algorithm development.

problem Computing Wasserstein barycenters of discrete probability measures with fixed support.

method Developed a deterministic variant of IBP algorithm, FastIBP, with improved complexity.

result Demonstrated favorable performance of FastIBP in practice.

Wasserstein barycenters fixed-support computational hardness FastIBP deterministic algorithm

2020-02-12abs ↗pdf ↗

On Robust Optimal Transport: Computational Complexity and Barycenter Computationcs.LG

Paper tackles robust optimal transport with improved computational complexity and barycenter approximation.

problem Computing robust optimal transport and its barycenter efficiently.

method Sinkhorn-based algorithms for robust optimal transport and iterative Bregman projections for barycenter approximation.

result Improved computational complexity for robust optimal transport and barycenter approximation.

optimal transport robustness Sinkhorn algorithm barycenter iterative Bregman projections

2021-02-13abs ↗pdf ↗

Sparse and Continuous Attention Mechanismscs.LG

Paper extends sparse alternatives to softmax for continuous domains, enabling efficient attention mechanisms.

problem Efficiently assigning zero probability to irrelevant categories in continuous domains.

method Extend alpha-entmax to continuous domains, introducing continuous-domain attention mechanisms.

result Continuous attention allows attending to time intervals and compact regions, improving text classification, machine translation, and visual question answering.

sparse alternatives softmax continuous domains attention mechanisms Tsallis statistics

2020-06-12abs ↗pdf ↗

Exploring and Interacting with the Set of Good Sparse Generalized Additive Modelscs.LG

New algorithms approximate Rashomon set for sparse models, aiding expert interaction.

problem Lack of interaction between models and domain experts in classical machine learning.

method Approximate Rashomon set of sparse, generalized additive models using ellipsoids.

result Efficiently approximated Rashomon set facilitates model selection and exploration.

machine learning model selection sparse models Rashomon set ellipsoids

2023-03-28abs ↗pdf ↗

Utility-Invariant Support Selection and Eventwise Decoupling for Simultaneous Independent Multi-Outcome Betsmath.OC

Support selection and eventwise decoupling for simultaneous bets proven.

problem Optimizing expected utility for simultaneous independent events with multiple outcomes.

method Proved a support theorem for a broad class of strictly increasing strictly concave utilities, identifying the exact active support and proving independence from utility function.

result The exact active support is the eventwise union of single-event supports, independent of the utility function.

support selection eventwise decoupling simultaneous independent events expected utility strictly increasing strictly concave utilities

2026-03-25abs ↗pdf ↗

Sparse Continuous Distributions and Fenchel-Young Lossescs.LG

This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.

problem Creating flexible continuous distributions with varying support for machine learning applications.

method Defining

Ω

-regularized prediction maps and Fenchel-Young losses for arbitrary domains, and deriving new types of Gaussians and attention mechanisms.

result Sparse alternatives to continuous distributions, including deformed exponential families and

β

-Gaussians, are introduced.

sparse distributions continuous domains Fenchel-Young losses Tsallis negentropy attention mechanisms

2021-08-04abs ↗pdf ↗