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

Omar Bennouna

dblp:409/1491 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 first-author · 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
1 paper
Language models and text generation · 50% Probabilistic and Bayesian machine learning · 50%
Theoretical computer science
1 paper
Mathematical optimization · 50% Algorithmic game theory and mechanism design · 50%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › prompt tuning
context optimization
0.912025
Contextual Optimization Under Model Misspecification: A Tractable and Generalizable Approach · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
model misspecification
0.912025
Contextual Optimization Under Model Misspecification: A Tractable and Generalizable Approach · ICML 2025
Algorithmic game theory and mechanism design › decision theory
decision making under uncertainty
0.912025
What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization · NeurIPS 2025
Mathematical optimization
linear programming
0.912025
What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization · NeurIPS 2025

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

uncertainty sets · 0.9surrogate loss · 0.9integrated learning and optimization · 0.9geometric characterization · 0.9
YearPublicationVenuePosition
2025 Contextual Optimization Under Model Misspecification: A Tractable and Generalizable Approach
abstract
Contextual optimization problems are prevalent in decision-making applications where historical data and contextual features are used to learn predictive models that inform optimal actions. However, practical applications often suffer from model misspecification due to incomplete knowledge of the underlying data-generating process, leading to suboptimal decisions. Existing approaches primarily address the well-specified case, leaving a critical gap in handling misspecified models. In this paper, we propose a novel Integrated Learning and Optimization (ILO) framework that explicitly accounts for model misspecification by introducing a tractable surrogate loss function with strong theoretical guarantees on generalizability, tractability, and optimality. Our surrogate loss aligns with the true decision performance objective, ensuring robustness to misspecification without imposing restrictive assumptions. The proposed approach effectively mitigates the challenges of non-convexity and non-smoothness in the target loss function, leading to efficient optimization procedures. We provide rigorous theoretical analysis and experimental validation, demonstrating superior performance compared to state-of-the-art methods. Our work offers a principled solution to the practically relevant challenge of model misspecification in contextual optimization.
Omar Bennouna, Jiawei Zhang 0007, Saurabh Amin, Asuman E. Ozdaglar
ICML1
2025 What Data Enables Optimal Decisions? An Exact Characterization for Linear Optimization
abstract
We study the fundamental question of how informative a dataset is for solving a given decision-making task. In our setting, the dataset provides partial information about unknown parameters that influence task outcomes. Focusing on linear programs, we characterize when a dataset is sufficient to recover an optimal decision, given an uncertainty set on the cost vector. Our main contribution is a sharp geometric characterization that identifies the directions of the cost vector that matter for optimality, relative to the task constraints and uncertainty set. We further develop a practical algorithm that, for a given task, constructs a minimal or least-costly sufficient dataset. Our results reveal that small, well-chosen datasets can often fully determine optimal decisions---offering a principled foundation for task-aware data selection.
Omar Bennouna, Amine Bennouna, Saurabh Amin, Asuman E. Ozdaglar
NeurIPS1