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

Stephan Xie

dblp:359/5773 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
2 papers
Learning theory · 33% Trustworthy machine learning · 33% Deep learning architectures and training · 33%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 87% Approximation and online algorithms · 13%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › fairness › fairness criteria
multicalibration
0.912025
High-Dimensional Prediction for Sequential Decision Making · ICML 2025
Machine learning › Learning theory
online learning
0.912025
High-Dimensional Prediction for Sequential Decision Making · ICML 2025
Machine learning › Deep learning architectures and training › foundation model
time series foundation model
0.912025
This Time is Different: An Observability Perspective on Time Series Foundation Models · NeurIPS 2025
Algorithmic game theory and mechanism design
online decision making
0.912025
High-Dimensional Prediction for Sequential Decision Making · ICML 2025
Algorithmic game theory and mechanism design › regret minimization
swap regret
0.912025
High-Dimensional Prediction for Sequential Decision Making · ICML 2025
Approximation and online algorithms › online algorithms
online combinatorial optimization
0.312025
High-Dimensional Prediction for Sequential Decision Making · ICML 2025

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

synthetic data generation · 1.7pre-training · 1.7online forecasting · 1.7conditional regret minimization · 1.7
YearPublicationVenuePosition
2025 High-Dimensional Prediction for Sequential Decision Making
abstract
We give an efficient algorithm for producing multi-dimensional forecasts in an online adversarial environment that have low bias subject to any polynomial number of conditioning events, that can depend both on external context and on our predictions themselves. We demonstrate the use of this algorithm with several applications. We show how to make predictions that can be transparently consumed by any polynomial number of downstream decision makers with different utility functions, guaranteeing them diminishing swap regret at optimal rates. We also give the first efficient algorithms for guaranteeing diminishing conditional regret in online combinatorial optimization problems for an arbitrary polynomial number of conditioning events --- i.e. on an arbitrary number of intersecting subsequences determined both by context and our own predictions. Finally, we give the first efficient algorithm for online multicalibration with $O(T^{2/3})$ rates in the ECE metric.
Georgy Noarov, Ramya Ramalingam, Aaron Roth 0001, Stephan Xie
ICML4
2025 This Time is Different: An Observability Perspective on Time Series Foundation Models
abstract
We introduce Toto, a time series forecasting foundation model with 151 million parameters. Toto uses a modern decoder-only architecture coupled with architectural innovations designed to account for specific challenges found in multivariate observability time series data. Toto's pre-training corpus is a mixture of observability data, open datasets, and synthetic data, and is 4-10$\times$ larger than those of leading time series foundation models. Additionally, we introduce BOOM, a large-scale benchmark consisting of 350 million observations across 2,807 real-world time series. For both Toto and BOOM, we source observability data exclusively from our own telemetry and internal observability metrics. Extensive evaluations demonstrate that Toto achieves state-of-the-art performance on both BOOM and on established general purpose time series forecasting benchmarks. Toto's model weights, inference code, and evaluation scripts, as well as BOOM's data and evaluation code, are all available as open source under the Apache 2.0 License.
Ben Cohen, Emaad Khwaja, Youssef Doubli, Salahidine Lemaachi, Chris Lettieri, Charles Masson, Hugo Miccinilli, Elise Ramé, Qiqi Ren, Afshin Rostamizadeh, Jean Ogier du Terrail, Anna-Monica Toon, Stephan Xie, Zongzhe Xu, Viktoriya Zhukova, David Asker, Ameet Talwalkar, Othmane Abou-Amal
NeurIPS14