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

Eilam Shapira

dblp:347/9035 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0007-4536-5758ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Trustworthy machine learning · 33% Reinforcement learning · 17% Planning, search and constraint satisfaction · 17%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
generalist agents
1.012026
From Benchmarks to Business Impact: Deploying IBM Generalist Agent in Enterprise Production · AAAI 2026
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
hierarchical planning
1.012026
From Benchmarks to Business Impact: Deploying IBM Generalist Agent in Enterprise Production · AAAI 2026
Machine learning › Trustworthy machine learning › fairness
algorithmic fairness
0.912025
Fairness under Competition · NeurIPS 2025
Machine learning › Trustworthy machine learning
fairness
0.912025
Fairness under Competition · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation › foundation model adaptation
in-context learning for tabular data
0.912025
TabSTAR: A Tabular Foundation Model for Tabular Data with Text Fields · NeurIPS 2025
Machine learning › Deep learning architectures and training › foundation model
tabular foundation model
0.912025
TabSTAR: A Tabular Foundation Model for Tabular Data with Text Fields · NeurIPS 2025
Machine learning › Trustworthy machine learning › fairness › fairness criteria
equal opportunity
0.312025
Fairness under Competition · NeurIPS 2025

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

hierarchical planning · 2.0benchmark evaluation · 2.0fair classification · 1.7transformer · 0.9target-aware attention · 0.9pre-trained text encoder · 0.9
YearPublicationVenuePosition
2026 From Benchmarks to Business Impact: Deploying IBM Generalist Agent in Enterprise Production
abstract
Agents are rapidly advancing in automating digital work, but enterprises face a harder challenge: moving beyond prototypes to deployed systems that deliver measurable business value. This path is complicated by fragmented frameworks, slow development, and the absence of standardized evaluation practices. Generalist agents have emerged as a promising direction, excelling on academic benchmarks and offering flexibility across tasks, applications, and modalities. Yet, evidence of their use in enterprise settings remains limited. This paper reports IBM’s experience developing and piloting the Computer Using Generalist Agent (CUGA). CUGA adopts a hierarchical planner--executor architecture with strong analytical foundations, achieving state-of-the-art performance on AppWorld and WebArena. Beyond benchmarks, it was evaluated in a Business-Process-Outsourcing talent acquisition pilot, addressing enterprise requirements for scalability, auditability, safety, and governance. In preliminary evaluations, CUGA approached the accuracy of specialized agents while suggesting reductions in development time and cost. We provide early evidence that generalist agents can operate at enterprise scale, distill key technical and organizational lessons, and outline requirements for transitioning research-grade architectures like CUGA into enterprise-ready systems.
Segev Shlomov, Alon Oved, Sami Marreed, Ido Levy, Offer Akrabi, Avi Yaeli, Lukasz Strak, Elizabeth Koumpan, Yinon Goldshtein, Eilam Shapira, Nir Mashkif, Asaf Adi
AAAI10
2026 Can LLMs Replace Economic Choice Prediction Labs? The Case of Language-based Persuasion Games
abstract
Human choice prediction in economic contexts is crucial for applications in marketing, finance, public policy, and more. This task, however, is often constrained by the difficulties in acquiring human choice data. With most experimental economics studies focusing on simple choice settings, the AI community has explored whether LLMs can substitute for humans in these predictions and examined more complex experimental economics settings. However, a key question remains: can LLMs generate training data for human choice prediction? We explore this in language-based persuasion games, a complex economic setting involving natural language in strategic interactions. Our experiments show that models trained on LLM-generated data can effectively predict human behavior in these games and even outperform models trained on actual human data. Beyond data generation, we investigate the dual role of LLMs as both data generators and predictors, introducing a comprehensive empirical study on the effectiveness of utilizing LLMs for data generation, human choice prediction, or both. We then utilize our choice prediction framework to analyze how strategic factors shape decision-making, showing that interaction history (rather than linguistic sentiment alone) plays a key role in predicting human decision-making in repeated interactions. Particularly, when LLMs capture history-dependent decision patterns similarly to humans, their predictive success improves substantially. Finally, we demonstrate the robustness of our findings across alternative persuasion-game settings, highlighting the broader potential of using LLM-generated data to model human decision-making.
Eilam Shapira, Omer Madmon, Roi Reichart, Moshe Tennenholtz
J. Artif. Intell. Res.1
2025 TabSTAR: A Tabular Foundation Model for Tabular Data with Text Fields
abstract
While deep learning has achieved remarkable success across many domains, it has historically underperformed on tabular learning tasks, which remain dominated by gradient boosting decision trees. However, recent advancements are paving the way for Tabular Foundation Models, which can leverage real-world knowledge and generalize across diverse datasets, particularly when the data contains free-text. Although incorporating language model capabilities into tabular tasks has been explored, most existing methods utilize static, target-agnostic textual representations, limiting their effectiveness. We introduce TabSTAR: a Tabular Foundation Model with Semantically Target-Aware Representations. TabSTAR is designed to enable transfer learning on tabular data with textual features, with an architecture free of dataset-specific parameters. It unfreezes a pretrained text encoder and takes as input target tokens, which provide the model with the context needed to learn task-specific embeddings. TabSTAR achieves state-of-the-art performance for both medium- and large-sized datasets across known benchmarks of classification tasks with text features, and its pretraining phase exhibits scaling laws in the number of datasets, offering a pathway for further performance improvements.
Alan Arazi, Eilam Shapira, Roi Reichart
NeurIPS2
2025 Fairness under Competition
abstract
Algorithmic fairness has emerged as a central issue in ML, and it has become standard practice to adjust ML algorithms so that they will satisfy fairness requirements such as Equal Opportunity. In this paper we consider the effects of adopting such fair classifiers on the overall level of _ecosystem fairness_. Specifically, we introduce the study of fairness with competing firms, and demonstrate the failure of fair classifiers in yielding fair ecosystems. Our results quantify the loss of fairness in systems, under a variety of conditions, based on classifiers' correlation and the level of their data overlap. We show that even if competing classifiers are individually fair, the ecosystem's outcome may be unfair; and that adjusting biased algorithms to improve their individual fairness may lead to an overall decline in ecosystem fairness. In addition to these theoretical results, we also provide supporting experimental evidence. Together, our model and results provide a novel and essential call for action.
Ronen Gradwohl, Eilam Shapira, Moshe Tennenholtz
NeurIPS2
2025 Human Choice Prediction in Language-based Persuasion Games: Simulation-based Off-Policy Evaluation
abstract
Abstract Recent advances in Large Language Models (LLMs) have spurred interest in designing LLM-based agents for tasks that involve interaction with human and artificial agents. This paper addresses a key aspect in the design of such agents: predicting human decisions in off-policy evaluation (OPE). We focus on language-based persuasion games, where an expert aims to influence the decision-maker through verbal messages. In our OPE framework, the prediction model is trained on human interaction data collected from encounters with one set of expert agents, and its performance is evaluated on interactions with a different set of experts. Using a dedicated application, we collected a dataset of 87K decisions from humans playing a repeated decision-making game with artificial agents. To enhance off-policy performance, we propose a simulation technique involving interactions across the entire agent space and simulated decision-makers. Our learning strategy yields significant OPE gains, e.g., improving prediction accuracy in the top 15% challenging cases by 7.1%.1
Eilam Shapira, Omer Madmon, Reut Apel, Moshe Tennenholtz, Roi Reichart
Trans. Assoc. Comput. Linguistics1