Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jeong, Seonghyeon, Wu, Hau-Tieng
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms 90C26, 90C30 F.2.2; F.2.0; G.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

Loop unrolling of UCA models: distance labeling
par: Soulignac, Francisco J, et autres
Publié: (2022)

Approximation algorithms for the prize-collecting rural postman problem
par: Li, Hong, et autres
Publié: (2026)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
par: Neira, David E. Bernal, et autres
Publié: (2021)

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

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
par: Dau, Son Hoang, et autres
Publié: (2022)

Modern column generation for estimating single- and multi-purchase ranked list choice models
par: Costa, Luciano, et autres
Publié: (2026)

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

Efficient Approximation of Fractional Hypertree Width
par: Korchemna, Viktoriia, et autres
Publié: (2024)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
par: Klein, Kim-Manuel, et autres
Publié: (2024)

An improved approximation algorithm for k-Median
par: Young, Neal E.
Publié: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
par: Gratton, Serge, et autres
Publié: (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
par: Hochbaum, Dorit S.
Publié: (2016)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
par: Diaby, Moustapha, et autres
Publié: (2023)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
par: Gratton, Serge, et autres
Publié: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
par: Gratton, S., et autres
Publié: (2022)

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

A unified worst case for classical simplex and policy iteration pivot rules
par: Disser, Yann, et autres
Publié: (2023)

Online Paging with Heterogeneous Cache Slots
par: Chrobak, Marek, et autres
Publié: (2022)

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
par: Li, Zijun, et autres
Publié: (2026)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
par: Aref, Samin, et autres
Publié: (2025)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
par: Chen, Yongyu
Publié: (2023)

Hesse's Redemption: Efficient Convex Polynomial Programming
par: Slot, Lucas, et autres
Publié: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
par: Cheng, Cong-Dian
Publié: (2017)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
par: Chimani, Markus, et autres
Publié: (2021)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
par: Foos, Josefine, et autres
Publié: (2023)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
par: Alimi, Morteza, et autres
Publié: (2025)

Enhancing Model Based Derivative Free Optimization using Direct Search
par: Li, Zijun, et autres
Publié: (2026)

Discovering Algorithms with Computational Language Processing
par: Bourdais, Theo, et autres
Publié: (2025)

Designing Capacitated Subnetworks for Shortest Path Routing
par: Chimani, Markus, et autres
Publié: (2026)

Learning-Based TSP-Solvers Tend to Be Overly Greedy
par: Li, Xiayang, et autres
Publié: (2025)

On the Complexity of the Bilevel Shortest Path Problem
par: Henke, Dorothee, et autres
Publié: (2024)

Discounted Cuts: A Stackelberg Approach to Network Disruption
par: Drange, Pål Grønås, et autres
Publié: (2025)

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

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

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network
par: Banerjee, Santanu, et autres
Publié: (2025)