Cover Image

Computing Brascamp-Lieb Constants through the lens of Thompson Geometry

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Weber, Melanie, Sra, Suvrit
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Computational Complexity Data Structures and Algorithms Functional Analysis 46N10, 49Q99, 53Z50, 68W40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$O(k)$-Equivariant Dimensionality Reduction on Stiefel Manifolds
by: Lee, Andrew, et al.
Published: (2023)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
by: Lynch, Nancy
Published: (2024)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Retraction based regression methods on Riemannian manifolds
by: Loayza-Romero, Estefanía, et al.
Published: (2026)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)

Multi-Headed Transformer Architectures as Time-dependent Wasserstein Gradient Flows
by: Massucco, Alex, et al.
Published: (2026)

An efficient volume-preserving MBO scheme for data clustering and classification
by: Krämer, Fabius, et al.
Published: (2024)

Generalizing Adam to Manifolds for Efficiently Training Transformers
by: Brantner, Benedikt
Published: (2023)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Quantified compactness in Lipschitz-free spaces of $[-1,1]^n$
by: De Pauw, Thierry
Published: (2025)

On weighted graph separation problems and flow-augmentation
by: Kim, Eun Jung, et al.
Published: (2022)

Introducing the Kernel Descent Optimizer for Variational Quantum Algorithms
by: Simon, Lars, et al.
Published: (2024)

On the approximation of the Riemannian barycenter
by: Mataigne, Simon, et al.
Published: (2025)

Accelerating Newton-Schulz Iteration for Orthogonalization via Chebyshev-type Polynomials
by: Grishina, Ekaterina, et al.
Published: (2025)

The effect of smooth parametrizations on nonconvex optimization landscapes
by: Levin, Eitan, et al.
Published: (2022)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

ConicCurv: A curvature estimation algorithm for planar polygons
by: Fuentes, R. Díaz, et al.
Published: (2025)

Algorithms for Minimum Membership Dominating Set Problem
by: Reddy, Sangam Balchandar, et al.
Published: (2024)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
by: Alpay, Faruk, et al.
Published: (2026)

Weighted, Multiphase, Volume-Preserving Mean Curvature Flow as Limit of the MBO Scheme on Manifolds
by: Krämer, Fabius
Published: (2025)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry
by: Basson, Dirk, et al.
Published: (2024)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Causal convergence conditions through variable timelike Ricci curvature bounds
by: Braun, Mathias, et al.
Published: (2023)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
by: Koiran, Pascal, et al.
Published: (2022)

Tree Containment Parameterized by Scanwidth
by: van Iersel, Leo, et al.
Published: (2026)

Dominating manifolds by radial spaces
by: Bronstein, Samuel
Published: (2025)

Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
by: Jain, Rahul, et al.
Published: (2019)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
by: Jansen, Klaus, et al.
Published: (2024)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
by: Larrauri, Alberto
Published: (2025)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)