93 citations · 537 across the 73 of their papers we have counts for
78 papers
Simpler Analyses of Union-Find
Zhiyi Huang, Chris Lambert, Zipei Nie +1
We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the , , , and $O(α(n))…
MathChat: Converse to Tackle Challenging Math Problems with LLM Agents
Yiran Wu, Feiran Jia, Shaokun Zhang +7
Employing Large Language Models (LLMs) to address mathematical problems is an intriguing research endeavor, considering the abundance of math problems expressed in natural language…
The Bit Complexity of Efficient Continuous Optimization
Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala
We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, -norm regression, and linear programming (LP). State-of-t…
Towards Lightweight and Automated Representation Learning System for Networks
Yuyang Xie, Jiezhong Qiu, Laxman Dhulipala +4
We propose LIGHTNE 2.0, a cost-effective, scalable, automated, and high-quality network embedding system that scales to graphs with hundreds of billions of edges on a single machin…
Fast Algorithms for -Regression
Deeksha Adil, Rasmus Kyng, Richard Peng +1
The -norm regression problem is a classic problem in optimization with wide ranging applications in machine learning and theoretical computer science. The goal is to comput…
Exponential Convergence of Sinkhorn Under Regularization Scheduling
Jingbang Chen, Li Chen, Yang P. Liu +2
In 2013, Cuturi [Cut13] introduced the Sinkhorn algorithm for matrix scaling as a method to compute solutions to regularized optimal transport problems. In this paper, aiming at a…