← Search

Aws Albarghouthi

8 accepted papers

2026

LiveResearchBench: Benchmarking Single- and Multi-Agent Systems for Citation-Grounded Deep Research

ICLR 2026poster

Deep research---producing comprehensive, citation-backed reports by searching across hundreds of live websites---marks an important frontier for agentic systems. To rigorously evaluate this ability, three principles are essential: tasks should be (1) user-centric, reflecting realistic information ne…

Cited by 0SourcecodeScholar
2025

Beyond Accuracy: Dissecting Mathematical Reasoning for LLMs Under Reinforcement Learning

NeurIPS 2025poster

Reinforcement learning (RL) has become the dominant paradigm for improving the performance of language models on complex reasoning tasks. Despite the substantial empirical gains demonstrated by RL-based training methods like GRPO, a granular understanding of why and how RL enhances performance is st…

Cited by 0SourcecodeScholar
2022

AutoWS-Bench-101: Benchmarking Automated Weak Supervision with 100 Labels

NeurIPS 2022accept

Weak supervision (WS) is a powerful method to build labeled datasets for training supervised models in the face of little-to-no labeled data. It replaces hand-labeling data with aggregating multiple noisy-but-cheap label estimates expressed by labeling functions (LFs). While it has been used success…

Cited by 8SourcePDFScholar
2021

Certified Robustness to Programmable Transformations in LSTMs

EMNLP 2021main

Deep neural networks for natural language processing are fragile in the face of adversarial examples—small input perturbations, like synonym substitution or word duplication, which cause a neural network to change its prediction. We present an approach to certifying the robustness of LSTMs (and exte…

2021

Certifying Robustness to Programmable Data Bias in Decision Trees

NeurIPS 2021poster

Datasets can be biased due to societal inequities, human biases, under-representation of minorities, etc. Our goal is to certify that models produced by a learning algorithm are pointwise-robust to dataset biases. This is a challenging problem: it entails learning models for a large, or even infinit…

Cited by 21SourcePDFScholar
2020

Generating Programmatic Referring Expressions via Program Synthesis

ICML 2020poster

Incorporating symbolic reasoning into machine learning algorithms is a promising approach to improve performance on learning tasks that require logical reasoning. We study the problem of generating a programmatic variant of referring expressions that we call referring relational programs. In particu…

2020

Robustness to Programmable String Transformations via Augmented Abstract Training

ICML 2020poster

Deep neural networks for natural language processing tasks are vulnerable to adversarial input perturbations. In this paper, we present a versatile language for programmatically specifying string transformations—e.g., insertions, deletions, substitutions, swaps, etc.—that are relevant to the task at…