Cover Image

An Eulerian approach to regularized JKO scheme with low-rank tensor decompositions for Bayesian inversion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aksenov, Vitalii, Eigel, Martin
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis Optimization and Control 46E27, 49Q22, 62F15, 68W25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Connections between convex optimization algorithms and subspace correction methods
by: Jiang, Boou, et al.
Published: (2025)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
by: Chiarini, Alberto, et al.
Published: (2024)

Dynamic Regret for Online Regression in RKHS via Discounted VAW and Subspace Approximation
by: Rokhlin, Dmitry B., et al.
Published: (2026)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances
by: Lindbloom, Jonathan, et al.
Published: (2024)

Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
by: Greco, Giacomo, et al.
Published: (2025)

A convergence rate for the entropic JKO scheme
by: Baradat, Aymeric, et al.
Published: (2026)

Explicit Construction of Approximate Kolmogorov Superpositions with C2 Smoothness
by: Song, Lunji, et al.
Published: (2025)

Visualizing Shape Functionals via Sinkhorn Multidimensional Scaling
by: Yachimura, Toshiaki, et al.
Published: (2024)

Nearly Optimal Stochastic Approximation for Online Principal Subspace Estimation
by: Liang, Xin, et al.
Published: (2017)

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

On the Optimality of the Oja's Algorithm for Online PCA
by: Liang, Xin
Published: (2021)

Provable Post-Training Quantization: Theoretical Analysis of OPTQ and Qronos
by: Zhang, Haoyu, et al.
Published: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Approximating k-Center via Farthest-First on $δ$-Covers
by: Wilson, Jason R.
Published: (2026)

Sliced Wasserstein Geodesics and Equivalence Wasserstein and Sliced Wasserstein metrics
by: Hopper, John Seale
Published: (2024)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
by: Gribling, Sander, et al.
Published: (2025)

An ADMM-Based Approach to Quadratically-Regularized Distributed Optimal Transport on Graphs
by: Mokhtari, Yacine, et al.
Published: (2024)

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

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
by: Atenas, Felipe, et al.
Published: (2024)

60 years of cyclic monotonicity: a survey
by: De Pascale, L., et al.
Published: (2023)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

Meshless Shape Optimization using Neural Networks and Partial Differential Equations on Graphs
by: Martinet, Eloi, et al.
Published: (2025)

Sum-of-Gaussians tensor neural networks for high-dimensional Schrödinger equation
by: Zhou, Qi, et al.
Published: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Interpolating between Optimal Transport and KL regularized Optimal Transport using Rényi Divergences
by: Bresch, Jonas, et al.
Published: (2024)

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

Asymptotics for Optimal Empirical Quantization of Measures
by: Quattrocchi, Filippo
Published: (2024)

Sinkhorn algorithms for entropic vector quantile regression
by: Kato, Kengo, et al.
Published: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Implicit Regularization of Large Neural Networks via Mean-Field Formulation
by: Acciaio, Beatrice, et al.
Published: (2026)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
by: Burns, Matthew X., et al.
Published: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

LieDetect: Detection of representation orbits of compact Lie groups from point clouds
by: Ennes, Henrique, et al.
Published: (2023)

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)