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

Antonis Antoniades

dblp:360/0952 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0001-6334-245XORCID · reported

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 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
4 papers
Language models and text generation · 31% Trustworthy machine learning · 27% Learning theory · 15%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › neural network theory
memorization and generalization
0.912025
Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data · ICLR 2025
Natural language and speech › Language models and text generation › large language model training › language model pretraining
pretraining data analysis
0.912025
Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data · ICLR 2025
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation
0.812024
Global Human-guided Counterfactual Explanations for Molecular Properties via Reinforcement Learning · KDD 2024
Machine learning › Graph learning
graph neural network
0.812024
Global Human-guided Counterfactual Explanations for Molecular Properties via Reinforcement Learning · KDD 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Global Human-guided Counterfactual Explanations for Molecular Properties via Reinforcement Learning · KDD 2024
Bioinformatics and computational biology › neuroscience › neuroinformatics
neural data analysis
0.812024
Neuroformer: Multimodal and Multitask Generative Pretraining for Brain Data · ICLR 2024
Machine learning › Efficient and distributed learning › large-scale learning
model scaling
0.312025
Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data · ICLR 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › game tree search
monte carlo tree search
0.312025
SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement · ICLR 2025
Machine learning › Deep learning architectures and training › sequence modeling › sequence generation
autoregressive generation
0.212024
Neuroformer: Multimodal and Multitask Generative Pretraining for Brain Data · ICLR 2024

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

multi-agent debate · 1.7monte carlo tree search · 1.7large language model · 1.7autoregressive modeling · 1.5n-gram language model · 0.9correlation analysis · 0.9reinforcement learning · 0.8proximal policy optimization · 0.8generative pretrained transformer · 0.8generative pre-trained transformer · 0.8VAE-based graph generator · 0.8
YearPublicationVenuePosition
2025 Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data
abstract
The impressive capabilities of large language models (LLMs) have sparked debate over whether these models genuinely generalize to unseen tasks or predominantly rely on memorizing vast amounts of pretraining data. To explore this issue, we introduce an extended concept of memorization, distributional memorization, which measures the correlation between the LLM output probabilities and the pretraining data frequency. To effectively capture task-specific pretraining data frequency, we propose a novel task-gram language model, which is built by counting the co-occurrence of semantically related $n$-gram pairs from task inputs and outputs in the pretraining corpus. Using the Pythia models trained on the Pile dataset, we evaluate four distinct tasks: machine translation, factual question answering, world knowledge understanding, and math reasoning. Our findings reveal varying levels of memorization, with the strongest effect observed in factual question answering. Furthermore, while model performance improves across all tasks as LLM size increases, only factual question answering shows an increase in memorization, whereas machine translation and reasoning tasks exhibit greater generalization, producing more novel outputs. This study demonstrates that memorization plays a larger role in simpler, knowledge-intensive tasks, while generalization is the key for harder, reasoning-based tasks, providing a scalable method for analyzing large pretraining corpora in greater depth.
Xinyi Wang 0003, Antonis Antoniades, Yanai Elazar, Alfonso Amayuelas, Alon Albalak, Kexun Zhang, William Yang Wang
ICLR2
2025 SWE-Search: Enhancing Software Agents with Monte Carlo Tree Search and Iterative Refinement
abstract
Software engineers operating in complex and dynamic environments must continuously adapt to evolving requirements, learn iteratively from experience, and reconsider their approaches based on new insights. However, current large language model (LLM)-based software agents often follow linear, sequential processes that prevent backtracking and exploration of alternative solutions, limiting their ability to rethink their strategies when initial approaches prove ineffective. To address these challenges, we propose SWE-Search, a multi-agent framework that integrates Monte Carlo Tree Search (MCTS) with a self-improvement mechanism to enhance software agents' performance on repository-level software tasks. SWE-Search extends traditional MCTS by incorporating a hybrid value function that leverages LLMs for both numerical value estimation and qualitative evaluation. This enables self-feedback loops where agents iteratively refine their strategies based on both quantitative numerical evaluations and qualitative natural language assessments of pursued trajectories. The framework includes a SWE-Agent for adaptive exploration, a Value Agent for iterative feedback, and a Discriminator Agent that facilitates multi-agent debate for collaborative decision-making. Applied to the SWE-bench benchmark, our approach demonstrates a 23% relative improvement in performance across five models compared to standard open-source agents without MCTS. Our analysis reveals how performance scales with increased inference-time compute through deeper search, providing a pathway to improve software agents without requiring larger models or additional training data. This highlights the potential of self-evaluation driven search techniques in complex software engineering environments.
Antonis Antoniades, Albert Örwall, Kexun Zhang, Yuxi Xie, Anirudh Goyal, William Yang Wang
ICLR1
2024 Neuroformer: Multimodal and Multitask Generative Pretraining for Brain Data
abstract
State-of-the-art systems neuroscience experiments yield large-scale multimodal data, and these data sets require new tools for analysis. Inspired by the success of large pretrained models in vision and language domains, we reframe the analysis of large-scale, cellular-resolution neuronal spiking data into an auto-regressive spatiotemporal generation problem. Neuroformer is a multimodal, multitask generative pre-trained transformer (GPT) model that is specifically designed to handle the intricacies of data in systems neuroscience. It scales linearly with feature size, can process an arbitrary number of modalities, and is adaptable to downstream tasks, such as predicting behavior. We first trained Neuroformer on simulated datasets, and found that it both accurately predicted simulated neuronal circuit activity, and also intrinsically inferred the underlying neural circuit connectivity, including direction. When pretrained to decode neural responses, the model predicted the behavior of a mouse with only few-shot fine-tuning, suggesting that the model begins learning how to do so directly from the neural representations themselves, without any explicit supervision. We used an ablation study to show that joint training on neuronal responses and behavior boosted performance, highlighting the model's ability to associate behavioral and neural representations in an unsupervised manner. These findings show that Neuroformer can analyze neural datasets and their emergent properties, informing the development of models and hypotheses associated with the brain.
Antonis Antoniades, Yiyi Yu, Joseph Canzano, William Yang Wang, Spencer L. Smith
ICLR1
2024 Global Human-guided Counterfactual Explanations for Molecular Properties via Reinforcement Learning
abstract
Counterfactual explanations of Graph Neural Networks (GNNs) offer a powerful way to understand data that can naturally be represented by a graph structure. Furthermore, in many domains, it is highly desirable to derive data-driven global explanations or rules that can better explain the high-level properties of the models and data in question. However, evaluating global counterfactual explanations is hard in real-world datasets due to a lack of human-annotated ground truth, which limits their use in areas like molecular sciences. Additionally, the increasing scale of these datasets provides a challenge for random search-based methods. In this paper, we develop a novel global explanation model RLHEX for molecular property prediction. It aligns the counterfactual explanations with human-defined principles, making the explanations more interpretable and easy for experts to evaluate. RLHEX includes a VAE-based graph generator to generate global explanations and an adapter to adjust the latent representation space to human-defined principles. Optimized by Proximal Policy Optimization (PPO), the global explanations produced by RLHEX cover 4.12% more input graphs and reduce the distance between the counterfactual explanation set and the input set by 0.47% on average across three molecular datasets. RLHEX provides a flexible framework to incorporate different human-designed principles into the counterfactual explanation generation process, aligning these explanations with domain expertise. The code and data are released at https://github.com/dqwang122/RLHEX.
Danqing Wang, Antonis Antoniades, Kha-Dinh Luong, Edwin Zhang, Mert Kosan, Ambuj K. Singh, William Yang Wang, Lei Li 0005
KDD2