Yancheng Yuan

Orcid: 0000-0002-8243-4683

According to our database1, Yancheng Yuan authored at least 27 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Addressing Delayed Feedback in Conversion Rate Prediction via Influence Functions.
CoRR, February, 2025

Understanding Deep Learning via Decision Boundary.
IEEE Trans. Neural Networks Learn. Syst., January, 2025

2024
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints.
SIAM J. Optim., 2024

A highly efficient algorithm for solving exclusive lasso problems.
Optim. Methods Softw., 2024

A Survey on Large Language Model-based Agents for Statistics and Data Science.
CoRR, 2024

One Shot, One Talk: Whole-body Talking Avatar from a Single Image.
CoRR, 2024

Unified Parameter-Efficient Unlearning for LLMs.
CoRR, 2024

RosePO: Aligning LLM-based Recommenders with Human Values.
CoRR, 2024

Adaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Number.
CoRR, 2024

LAMBDA: A Large Model Based Data Agent.
CoRR, 2024

LLaRA: Large Language-Recommendation Assistant.
Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024

Collective Certified Robustness against Graph Injection Attacks.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Revisiting Demonstration Selection Strategies in In-Context Learning.
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024

2023
XAI for In-hospital Mortality Prediction via Multimodal ICU Data.
CoRR, 2023

LLaRA: Aligning Large Language Models with Sequential Recommenders.
CoRR, 2023

Large Language Model Can Interpret Latent Space of Sequential Recommender.
CoRR, 2023

Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees.
CoRR, 2023

Invariant Collaborative Filtering to Popularity Distribution Shift.
Proceedings of the ACM Web Conference 2023, 2023

Generate What You Prefer: Reshaping Sequential Recommendation via Guided Diffusion.
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
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm.
J. Mach. Learn. Res., 2021

Learning Intents behind Interactions with Knowledge Graph for Recommendation.
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
An Efficient Semismooth Newton Based Algorithm for Convex Clustering.
Proceedings of the 35th International Conference on Machine Learning, 2018

2014
Robust interactive image segmentation via iterative refinement.
Proceedings of the 2014 IEEE International Conference on Image Processing, 2014


  Loading...