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.

Changlun Li

dblp:336/6004 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0001-9196-490XORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Computational finance and economics
algorithmic trading
0.912025
Time Travel is Cheating: Going Live with DeepFund for Real-Time Fund Investment Benchmarking · NeurIPS 2025
Computational finance and economics
portfolio management
0.912025
Time Travel is Cheating: Going Live with DeepFund for Real-Time Fund Investment Benchmarking · NeurIPS 2025
Data integration and cleaning
data transformation
0.912025
Weak-to-Strong Prompts with Lightweight-to-Powerful LLMs for High-Accuracy, Low-Cost, and Explainable Data Transformation · Proc. VLDB Endow. 2025
Program synthesis and code generation
code generation with language models
0.912025
Weak-to-Strong Prompts with Lightweight-to-Powerful LLMs for High-Accuracy, Low-Cost, and Explainable Data Transformation · Proc. VLDB Endow. 2025
Natural language and speech › Language models and text generation › prompting
prompt engineering
0.312025
Weak-to-Strong Prompts with Lightweight-to-Powerful LLMs for High-Accuracy, Low-Cost, and Explainable Data Transformation · Proc. VLDB Endow. 2025

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

large language model · 3.5retrieval-augmented generation · 2.6fine-tuning · 2.6multi-agent system · 0.9
YearPublicationVenuePosition
2025 Time Travel is Cheating: Going Live with DeepFund for Real-Time Fund Investment Benchmarking
abstract
Large Language Models (LLMs) have demonstrated notable capabilities across financial tasks, including financial report summarization, earnings call transcript analysis, and asset classification. However, their real-world effectiveness in managing complex fund investment remains inadequately assessed. A fundamental limitation of existing benchmarks for evaluating LLM-driven trading strategies is their reliance on historical back-testing, inadvertently enabling LLMs to "time travel"—leveraging future information embedded in their training corpora, thus resulting in possible information leakage and overly optimistic performance estimates. To address this issue, we introduce DeepFund, a live fund benchmark tool designed to rigorously evaluate LLM in real-time market conditions. Utilizing a multi-agent architecture, DeepFund connects directly with real-time stock market data—specifically data published after each model’s pretraining cutoff—to ensure fair and leakage-free evaluations. Empirical tests on nine flagship LLMs from leading global institutions across multiple investment dimensions—including ticker-level analysis, investment decision-making, portfolio management, and risk control—reveal significant practical challenges. Notably, even cutting-edge models such as DeepSeek-V3 and Claude-3.7-Sonnet incur net trading losses within DeepFund real-time evaluation environment, underscoring the present limitations of LLMs for active fund management. Our code is available at https://github.com/HKUSTDial/DeepFund.
Changlun Li, Qiqi Duan, Runke Ruan, Haonan Long, Lijun Huang, Nan Tang 0001, Yuyu Luo
NeurIPS1
2025 Weak-to-Strong Prompts with Lightweight-to-Powerful LLMs for High-Accuracy, Low-Cost, and Explainable Data Transformation
abstract
Data transformation poses significant challenges due to the wide diversity in input data formats and different requirements. Existing approaches—including human-driven, algorithmic, and large language model (LLM)-based solutions—each exhibits trade-offs in terms of cost, accuracy, and the range of supported transformations. To address these limitations, we propose MegaTran , a novel framework for generating accurate and cost-effective data transformation code. MegaTran employs a two-stage process: Weak2StrongPrompt , which converts a user's weak prompt (a loosely specified user input) into a strong, structured prompt, and Prompt2Code , which generates transformation code based on this refined prompt. In Weak2StrongPrompt , a fine-tuned lightweight LLM predicts the transformation type and generates a detailed task description from the user's input. In Prompt2Code , a powerful LLM generates the corresponding transformation code, guided by two key optimizations: (1) Sanity-check Reflection with checklist , which iteratively debugs and refines the code by addressing errors; and (2) Lazy-RAG , a retrieval-augmented generation technique that retrieves relevant code snippets or documentation from external resources ( e.g. , GitHub, DataPrep) to enhance code quality. Extensive experiments show that MegaTran achieves results varying from +2.2% to +26.1% accuracy improvement compared with SoTA methods.
Changlun Li, Yuyu Luo, Ju Fan, Nan Tang 0001
Proc. VLDB Endow.1
2023 An exploitation-boosted sine cosine algorithm for global optimization
Changlun Li, Ke Liang 0005, Mingzhang Pan
Eng. Appl. Artif. Intell.1