Cover Image

Convergence analysis of t-SNE as a gradient flow for point cloud on a manifold

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jeong, Seonghyeon, Wu, Hau-Tieng
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms 90C26, 90C30 F.2.2; F.2.0; G.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Loop unrolling of UCA models: distance labeling
by: Soulignac, Francisco J, et al.
Published: (2022)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
by: Dau, Son Hoang, et al.
Published: (2022)

Modern column generation for estimating single- and multi-purchase ranked list choice models
by: Costa, Luciano, et al.
Published: (2026)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
by: Gratton, S., et al.
Published: (2026)

Efficient Approximation of Fractional Hypertree Width
by: Korchemna, Viktoriia, et al.
Published: (2024)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
by: Klein, Kim-Manuel, et al.
Published: (2024)

An improved approximation algorithm for k-Median
by: Young, Neal E.
Published: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
by: Hochbaum, Dorit S.
Published: (2016)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
by: Diaby, Moustapha, et al.
Published: (2023)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
by: Ali, Alejandro Mata
Published: (2025)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

A unified worst case for classical simplex and policy iteration pivot rules
by: Disser, Yann, et al.
Published: (2023)

Online Paging with Heterogeneous Cache Slots
by: Chrobak, Marek, et al.
Published: (2022)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
by: Li, Zijun, et al.
Published: (2026)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
by: Aref, Samin, et al.
Published: (2025)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
by: Chen, Yongyu
Published: (2023)

Hesse's Redemption: Efficient Convex Polynomial Programming
by: Slot, Lucas, et al.
Published: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
by: Cheng, Cong-Dian
Published: (2017)

Simple Approximations for General Spanner Problems
by: Bökler, Fritz, et al.
Published: (2025)

Exact Minimum Weight Spanners via Column Generation
by: Bökler, Fritz, et al.
Published: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
by: Foos, Josefine, et al.
Published: (2023)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
by: Alimi, Morteza, et al.
Published: (2025)

Enhancing Model Based Derivative Free Optimization using Direct Search
by: Li, Zijun, et al.
Published: (2026)

Discovering Algorithms with Computational Language Processing
by: Bourdais, Theo, et al.
Published: (2025)

Designing Capacitated Subnetworks for Shortest Path Routing
by: Chimani, Markus, et al.
Published: (2026)

Learning-Based TSP-Solvers Tend to Be Overly Greedy
by: Li, Xiayang, et al.
Published: (2025)

On the Complexity of the Bilevel Shortest Path Problem
by: Henke, Dorothee, et al.
Published: (2024)

Discounted Cuts: A Stackelberg Approach to Network Disruption
by: Drange, Pål Grønås, et al.
Published: (2025)

Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows
by: Özyılmaz, Mustafa Mert
Published: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network
by: Banerjee, Santanu, et al.
Published: (2025)