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

Zitao Song

dblp:322/4149 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0003-4646-0339ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
3 papers
Probabilistic and Bayesian machine learning · 38% Reinforcement learning · 19% Knowledge representation and reasoning · 19%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process
temporal point process
1.522024
Latent Logic Tree Extraction for Event Sequence Explanation from LLMs · ICML 2024
Amortized Network Intervention to Steer the Excitatory Point Processes · ICLR 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning
0.812024
Latent Logic Tree Extraction for Event Sequence Explanation from LLMs · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked modeling
masked reconstruction
0.812024
Reinforcement Learning with Maskable Stock Representation for Portfolio Management in Customizable Stock Pools · WWW 2024
Machine learning › Reinforcement learning
model-based reinforcement learning
0.812024
Amortized Network Intervention to Steer the Excitatory Point Processes · ICLR 2024
Computational finance and economics
portfolio management
0.812024
Reinforcement Learning with Maskable Stock Representation for Portfolio Management in Customizable Stock Pools · WWW 2024
Computational finance and economics › portfolio management
reinforcement-learning-based portfolio management
0.812024
Reinforcement Learning with Maskable Stock Representation for Portfolio Management in Customizable Stock Pools · WWW 2024
Machine learning › Trustworthy machine learning › language model interpretability
large language model explanation
0.212024
Latent Logic Tree Extraction for Event Sequence Explanation from LLMs · ICML 2024

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

self-supervised masking · 1.5reweighting · 1.5reinforcement learning · 1.5neural ODE · 0.8mean-field approximation · 0.8lookahead planning · 0.8large language model prior · 0.8expectation-maximization · 0.8GFlowNets · 0.8
YearPublicationVenuePosition
2024 Amortized Network Intervention to Steer the Excitatory Point Processes
abstract
Excitatory point processes (i.e., event flows) occurring over dynamic graphs (i.e., evolving topologies) provide a fine-grained model to capture how discrete events may spread over time and space. How to effectively steer the event flows by modifying the dynamic graph structures presents an interesting problem, motivated by curbing the spread of infectious diseases through strategically locking down cities to mitigating traffic congestion via traffic light optimization. To address the intricacies of planning and overcome the high dimensionality inherent to such decision-making problems, we design an Amortized Network Interventions (ANI) framework, allowing for the pooling of optimal policies from history and other contexts while ensuring a permutation equivalent property. This property enables efficient knowledge transfer and sharing across diverse contexts. Each task is solved by an H-step lookahead model-based reinforcement learning, where neural ODEs are introduced to model the dynamics of the excitatory point processes. Instead of simulating rollouts from the dynamics model, we derive an analytical mean-field approximation for the event flows given the dynamics, making the online planning more efficiently solvable. We empirically illustrate that this ANI approach substantially enhances policy learning for unseen dynamics and exhibits promising outcomes in steering event flows through network intervention using synthetic and real COVID datasets.
Zitao Song, Wendi Ren, Shuang Li 0002
ICLR1
2024 Latent Logic Tree Extraction for Event Sequence Explanation from LLMs
abstract
Modern high-stakes systems, such as healthcare or robotics, often generate vast streaming event sequences. Our goal is to design an efficient, plug-and-play tool to elicit logic tree-based explanations from Large Language Models (LLMs) to provide customized insights into each observed event sequence. Built on the temporal point process model for events, our method employs the likelihood function as a score to evaluate generated logic trees. We propose an amortized Expectation-Maximization (EM) learning framework and treat the logic tree as latent variables. In the E-step, we evaluate the posterior distribution over the latent logic trees using an LLM prior and the likelihood of the observed event sequences. LLM provides a high-quality prior for the latent logic trees, however, since the posterior is built over a discrete combinatorial space, we cannot get the closed-form solution. We propose to generate logic tree samples from the posterior using a learnable GFlowNet, which is a diversity-seeking generator for structured discrete variables. The M-step employs the generated logic rules to approximate marginalization over the posterior, facilitating the learning of model parameters and refining the tunable LLM prior parameters. In the online setting, our locally built, lightweight model will iteratively extract the most relevant rules from LLMs for each sequence using only a few iterations. Empirical demonstrations showcase the promising performance and adaptability of our framework.
Zitao Song, Chaojie Wang 0001, Bo An 0001, Shuang Li 0002
ICML1
2024 Reinforcement Learning with Maskable Stock Representation for Portfolio Management in Customizable Stock Pools
abstract
Portfolio management (PM) is a fundamental financial trading task, which explores the optimal periodical reallocation of capitals into different stocks to pursue long-term profits. Reinforcement learning (RL) has recently shown its potential to train profitable agents for PM through interacting with financial markets. However, existing work mostly focuses on fixed stock pools, which is inconsistent with investors' practical demand. Specifically, the target stock pool of different investors varies dramatically due to their discrepancy on market states and individual investors may temporally adjust stocks they desire to trade (e.g., adding one popular stocks), which lead to customizable stock pools (CSPs). Existing RL methods require to retrain RL agents even with a tiny change of the stock pool, which leads to high computational cost and unstable performance. To tackle this challenge, we propose EarnMore, a rEinforcement leARNing framework with Maskable stOck REpresentation to handle PM with CSPs through one-shot training in a global stock pool (GSP). Specifically, we first introduce a mechanism to mask out the representation of the stocks outside the target pool. Second, we learn meaningful stock representations through a self-supervised masking and reconstruction process. Third, a re-weighting mechanism is designed to make the portfolio concentrate on favorable stocks and neglect the stocks outside the target pool. Through extensive experiments on 8 subset stock pools of the US stock market, we demonstrate that EarnMore significantly outperforms 14 state-of-the-art baselines in terms of 6 popular financial metrics with over 40% improvement on profit. Code is available in PyTorch1.
Wentao Zhang 0007, Yilei Zhao 0001, Yonggang Xie, Zitao Song, Xinrun Wang, Bo An 0001
WWW6
2023 From deterministic to stochastic: an interpretable stochastic model-free reinforcement learning framework for portfolio optimization
Zitao Song, Pin Qian, Sifan Song, Frans Coenen, Zhengyong Jiang, Jionglong Su
Appl. Intell.1