Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jiacheng You

dblp:283/2685 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0001-6041-7137ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Reinforcement learning · 26% Time series and sequential data · 23% Robot manipulation · 20%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model
1.012026
LoFT-LLM: Low-Frequency Time-series Forecasting with Large Language Models · KDD (1) 2026
Machine learning › Time series and sequential data › large language model for time series
LLM-based forecasting
1.012026
LoFT-LLM: Low-Frequency Time-series Forecasting with Large Language Models · KDD (1) 2026
Machine learning › Time series and sequential data › time series analysis
time series forecasting
1.012026
LoFT-LLM: Low-Frequency Time-series Forecasting with Large Language Models · KDD (1) 2026
Robotics › Legged, aerial and field robots › locomotion
energy-efficient locomotion
0.912025
Fine-Tuning Hard-to-Simulate Objectives for Quadruped Locomotion: A Case Study on Total Power Saving · ICRA 2025
Robotics › Robot manipulation › learning from demonstration
imitation learning for manipulation
0.912025
Data Scaling Laws in Imitation Learning for Robotic Manipulation · ICLR 2025
Robotics › Legged, aerial and field robots › legged robots › legged robot locomotion
quadruped locomotion
0.912025
Fine-Tuning Hard-to-Simulate Objectives for Quadruped Locomotion: A Case Study on Total Power Saving · ICRA 2025
Machine learning › Reinforcement learning
continuous control
0.812024
EfficientZero V2: Mastering Discrete and Continuous Control with Limited Data · ICML 2024
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
EfficientZero V2: Mastering Discrete and Continuous Control with Limited Data · ICML 2024
Machine learning › Reinforcement learning › sample efficiency
sample-efficient reinforcement learning
0.812024
EfficientZero V2: Mastering Discrete and Continuous Control with Limited Data · ICML 2024

Methods — techniques the papers use, named apart from their topics

residual learning · 1.0patch low-frequency module · 1.0fine-tuning · 1.0power-law scaling analysis · 0.9policy fine-tuning · 0.9imitation learning · 0.9data-driven modeling · 0.9self-supervised representation learning · 0.8monte carlo tree search · 0.8
YearPublicationVenuePosition
2026 LoFT-LLM: Low-Frequency Time-series Forecasting with Large Language Models
abstract
Time-series forecasting in real-world applications such as finance and energy often faces challenges due to limited training data and complex, noisy temporal dynamics. Existing deep forecasting models typically supervise predictions using full-length temporal windows, which include substantial high-frequency noise and obscure long-term trends. Moreover, auxiliary variables containing rich domain-specific information are often underutilized, especially in few-shot settings. To address these challenges, we propose LoFT-LLM, a frequency-aware forecasting pipeline that integrates low-frequency learning with semantic calibration via a large language model (LLM). Firstly, a Patch Low-Frequency forecasting Module (PLFM) extracts stable low-frequency trends from localized spectral patches. Secondly, a residual learner then models high-frequency variations. Finally, a fine-tuned LLM refines the predictions by incorporating auxiliary context and domain knowledge through structured natural language prompts. Extensive experiments on financial and energy datasets demonstrate that LoFT-LLM significantly outperforms strong baselines under both full-data and few-shot regimes, delivering superior accuracy, robustness, and interpretability.
Jiacheng You, Zhongxuan Wu, Xiucheng Li, Feng Li 0067, Pengjie Wang 0002, Jian Xu 0015, Bo Zheng 0007, Xinyang Chen 0001
KDD (1)1
2025 Data Scaling Laws in Imitation Learning for Robotic Manipulation
abstract
Data scaling has revolutionized fields like natural language processing and computer vision, providing models with remarkable generalization capabilities. In this paper, we investigate whether similar data scaling laws exist in robotics, particularly in robotic manipulation, and whether appropriate data scaling can yield single-task robot policies that can be deployed zero-shot for any object within the same category in any environment. To this end, we conduct a comprehensive empirical study on data scaling in imitation learning. By collecting data across numerous environments and objects, we study how a policy’s generalization performance changes with the number of training environments, objects, and demonstrations. Throughout our research, we collect over 40,000 demonstrations and execute more than 15,000 real-world robot rollouts under a rigorous evaluation protocol. Our findings reveal several intriguing results: the generalization performance of the policy follows a roughly power-law relationship with the number of environments and objects. The diversity of environments and objects is far more important than the absolute number of demonstrations; once the number of demonstrations per environment or object reaches a certain threshold, additional demonstrations have minimal effect. Based on these insights, we propose an efficient data collection strategy. With four data collectors working for one afternoon, we collect sufficient data to enable the policies for two tasks to achieve approximately 90\% success rates in novel environments with unseen objects.
Fanqi Lin, Yingdong Hu, Pingyue Sheng, Chuan Wen, Jiacheng You, Yang Gao 0029
ICLR5
2025 Fine-Tuning Hard-to-Simulate Objectives for Quadruped Locomotion: A Case Study on Total Power Saving
abstract
Legged locomotion is not just about mobility; it also encompasses crucial objectives such as energy efficiency, safety, and user experience, which are vital for real-world applications. However, key factors such as battery power consumption and stepping noise are often inaccurately modeled or missing in common simulators, leaving these aspects poorly optimized or unaddressed by current sim-to-real methods. Hand-designed proxies, such as mechanical power and foot contact forces, have been used to address these challenges but are often problem-specific and inaccurate. In this paper, we propose a data-driven framework for fine-tuning locomotion policies, targeting these hard-to-simulate objectives. Our framework leverages real-world data to model these objectives and incorporates the learned model into simulation for policy improvement. We demonstrate the effectiveness of our framework on power saving for quadruped locomotion, achieving a significant 24–28% net reduction in total power consumption from the battery pack at various speeds. In essence, our approach offers a versatile solution for optimizing hard-to-simulate objectives in quadruped locomotion, providing an easy-to-adapt paradigm for continual improving with real-world knowledge. Project page https://hard-to-sim.github.io/.
Ruiqian Nai, Jiacheng You, Liu Cao, Hanchen Cui, Huazhe Xu, Yang Gao 0029
ICRA2
2025 Meta Guidance: Incorporating Inductive Biases into Deep Time Series Imputers
abstract
Missing values, frequently encountered in time series data, can significantly impair the effectiveness of analytical methods. While deep imputation models have emerged as the predominant approach due to their superior performance, explicitly incorporating inductive biases aligned with time-series characteristics offers substantial improvement potential. Taking advantage of non-stationarity and periodicity in time series, two domain-specific inductive biases are designed: (1) Non-Stationary Guidance, which operationalizes the proximity principle to address highly non-stationary series by emphasizing temporal neighbors, and (2) Periodic Guidance, which exploits periodicity patterns through learnable weight allocation across historical periods. Building upon these complementary mechanisms, the overall module, named Meta Guidance, dynamically fuses both guidances through data-adaptive weights learned from the specific input sample. Experiments on nine benchmark datasets demonstrate that integrating Meta Guidance into existing deep imputation architectures achieves an average 27.39\% reduction in imputation error compared to state-of-the-art baselines.
Jiacheng You, Xinyang Chen 0001, Yu Sun 0027, Weili Guan, Liqiang Nie
NeurIPS1
2024 EfficientZero V2: Mastering Discrete and Continuous Control with Limited Data
abstract
Sample efficiency remains a crucial challenge in applying Reinforcement Learning (RL) to real-world tasks. While recent algorithms have made significant strides in improving sample efficiency, none have achieved consistently superior performance across diverse domains. In this paper, we introduce EfficientZero V2, a general framework designed for sample-efficient RL algorithms. We have expanded the performance of EfficientZero to multiple domains, encompassing both continuous and discrete actions, as well as visual and low-dimensional inputs. With a series of improvements we propose, EfficientZero V2 outperforms the current state-of-the-art (SoTA) by a significant margin in diverse tasks under the limited data setting. EfficientZero V2 exhibits a notable advancement over the prevailing general algorithm, DreamerV3, achieving superior outcomes in 50 of 66 evaluated tasks across multiple benchmarks, including Atari 100k, Proprio Control, and Vision Control.
Shaohuai Liu, Weirui Ye, Jiacheng You, Yang Gao 0029
ICML4