Yancheng Yuan
Orcid: 0000-0002-8243-4683
According to our database1,
Yancheng Yuan authored at least 45 papers
between 2014 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2026
VAE-Inf: A statistically interpretable generative paradigm for imbalanced classification.
CoRR, April, 2026
ACM Trans. Inf. Syst., March, 2026
Math. Program. Comput., March, 2026
DARE: Aligning LLM Agents with the R Statistical Ecosystem via Distribution-Aware Retrieval.
CoRR, March, 2026
Efficient Equivariant High-Order Crystal Tensor Prediction via Cartesian Local-Environment Many-Body Coupling.
CoRR, February, 2026
Think Dense, Not Long: Dynamic Decoupled Conditional Advantage for Efficient Reasoning.
CoRR, February, 2026
DSAEval: Evaluating Data Science Agents on a Wide Range of Real-World Data Science Problems.
CoRR, January, 2026
Magnitude-Modulated Equivariant Adapter for Parameter-Efficient Fine-Tuning of Equivariant Graph Neural Networks.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026
2025
dHPR: A Distributed Halpern Peaceman-Rachford Method for Non-smooth Distributed Optimization Problems.
CoRR, November, 2025
MLLMEraser: Achieving Test-Time Unlearning in Multimodal Large Language Models through Activation Steering.
CoRR, October, 2025
Math. Program. Comput., September, 2025
IEEE Trans. Pattern Anal. Mach. Intell., August, 2025
CoRR, February, 2025
IEEE Trans. Neural Networks Learn. Syst., January, 2025
SIAM J. Optim., 2025
Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees.
J. Mach. Learn. Res., 2025
Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2025
A Tight Convergence Analysis of Inexact Stochastic Proximal Point Algorithm for Stochastic Composite Optimization Problems.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025
Proceedings of the Thirteenth International Conference on Learning Representations, 2025
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2025
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2025
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2025
2024
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints.
SIAM J. Optim., 2024
Optim. Methods Softw., 2024
CoRR, 2024
Adaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Number.
CoRR, 2024
Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024
2023
Proceedings of the ACM Web Conference 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
2022
A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering.
SIAM J. Optim., September, 2022
On the Test Accuracy and Effective Control of the COVID-19 Pandemic: A Case Study in Singapore.
INFORMS J. Appl. Anal., 2022
2021
J. Mach. Learn. Res., 2021
Proceedings of the WWW '21: The Web Conference 2021, 2021
2020
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0).
Optim. Methods Softw., 2020
2019
On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models.
CoRR, 2019
2018
Proceedings of the 35th International Conference on Machine Learning, 2018
2014
Proceedings of the 2014 IEEE International Conference on Image Processing, 2014