Skip to content
conftrace_

Anthony Man-Cho So

25 papers · 2013–2025 · 6 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+8 more ↓ πŸ—ΊοΈ Taxonomy Completionist (35) 🌍 Conference Polyglot Β· Silver πŸƒ Academic Marathon Β· Half πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ‘‘ Triple Crown πŸ† Grand Slam πŸ”¬ Deep Specialist (15) ⚑ Prolific Year Β· Productive πŸ”₯ Unstoppable Β· Bronze πŸ’Ž Century Club Β· Bronze 🌈 Renaissance Researcher (5) πŸ—ƒοΈ Keyword Collector (119)

Papers

Probe-Free Low-Rank Activation Intervention NAACL 2025 Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization AISTATS 2024 Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data NeurIPS 2024 Non-Convex Joint Community Detection and Group Synchronization via Generalized Power Method AISTATS 2024 A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data ICLR 2023 LogSpecT: Feasible Graph Learning Model from Stationary Signals with Recovery Guarantees NeurIPS 2023 On the Effectiveness of Parameter-Efficient Fine-Tuning AAAI 2023 Outlier-Robust Gromov-Wasserstein for Graph Data NeurIPS 2023 Projected Tensor Power Method for Hypergraph Community Recovery ICML 2023 ReSync: Riemannian Subgradient-based Robust Rotation Synchronization NeurIPS 2023 Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization NeurIPS 2023 Computing D-Stationary Points of $ρ$-Margin Loss SVM AISTATS 2022 Convergence and Recovery Guarantees of the K-Subspaces Method for Subspace Clustering ICML 2022 Exact Community Recovery over Signed Graphs AISTATS 2022 On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions ICML 2022 Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums AISTATS 2022 A Theoretical Analysis of the Repetition Problem in Text Generation AAAI 2021 Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method ICML 2021 A Nearly-Linear Time Algorithm for Exact Community Recovery in Stochastic Block Model ICML 2020 Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst-Case Rates NeurIPS 2020 Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine NeurIPS 2020 A First-Order Algorithmic Framework for Distributionally Robust Logistic Regression NeurIPS 2019 Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods ICML 2016 \ell_1,p-Norm Regularization: Error Bounds and Convergence Rate Analysis of First-Order Methods ICML 2015 On the Linear Convergence of the Proximal Gradient Method for Trace Norm Regularization NeurIPS 2013