Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
Berkeley University of California
Home Home

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News, Publications, and Videos
    • News
    • Videos
    • AI + TCS Working Group
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Results 41 - 50 of 24600

Workshop Talk
|
Sept. 30, 2026

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids

No abstract available.

Workshop Talk
|
Sept. 30, 2026

Explicit Almost-Optimal ε-Balanced Codes via Free Expander Walks

No abstract available.

Workshop Talk
|
Sept. 30, 2026

Explicit free expanders

No abstract available.

Workshop Talk
|
Oct. 7, 2026

Aligning Evaluation Incentives to Reduce Hallucination

Large language models are typically evaluated using accuracy-based metrics that reward confident guessing while giving little or no credit for acknowledging uncertainty. Because evaluations influence which models and methods are selected, these incentives can work against techniques that reduce hallucinations at the cost of answering fewer questions. The talk discusses approaches to evaluation that better reward useful uncertainty and reflect the differing costs of mistakes, correct answers, and abstentions, along with open questions in designing evaluations whose incentives better match real-world objectives.

Based on joint work with Santosh Vempala, Ofir Nachum, and Edwin Zhang.

Workshop Talk
|
Oct. 7, 2026

Why Pretrained Models Hallucinate

We analyze hallucination in language models from a mathematical perspective and find that the statistical pressures of the next-word prediction training pipeline induce hallucinations under fairly general conditions even when trained on clean data. The core proof is a simple reduction from a natural classification task ("fact or hallucination") to a generation/prompt completion task.

The talk is based on facts and on work with Adam T. Kalai (STOC 2025) and with Kalai, Ofer Nachum and Eddie Zhang (Nature 2026).

Workshop Talk
|
Oct. 7, 2026

Reliability Along the Way: Progress and Failure Signals in AI Agents

LLM agents are increasingly deployed on long-horizon tasks with tool use, irreversible actions, and unpredictable feedback. Yet we have few principled ways to tell, mid-episode, whether an agent is on track or quietly failing. Most uncertainty quantification (UQ) research still centers on single-turn QA, a poor match for interactive agents. In this talk, I'll present a general formulation of agent UQ and the challenges unique to agentic settings, from choosing uncertainty estimators to modeling how uncertainty evolves over an interaction. I'll then show that a powerful answer has been hiding in plain sight: RL post-training already yields an implicit step-level signal, the progress advantage, which recovers the optimal advantage function with no annotation or reward-model training. Across test-time scaling, UQ, and failure attribution, this free byproduct beats confidence baselines and even dedicated trained reward models.

Workshop Talk
|
Sept. 30, 2026

A Simple Sub-Polynomial Degree Coboundary Expander

No abstract available.

Workshop Talk
|
Sept. 30, 2026

Sparser Abelian High Dimensional Expanders

No abstract available.

Video
|
Sept. 30, 2026
KMS complexes and their (higher) expansion properties
Video
|
Sept. 30, 2026
Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes

Pagination

  • Previous page Previous
  • Page 3
  • Page 4
  • Current page 5
  • Page 6
  • Page 7
  • Next page Next
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2026 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • Participate
    • Apply to Participate
    • Propose a Program
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
    • Chancellor's Professors
  • News, Publications, and Videos
    • News
    • Videos
    • AI + TCS Working Group
  • Support for the Institute
    • Annual Fund
    • All Funders
    • Institutional Partnerships
  • For Visitors
    • Visitor Guide
    • Plan Your Visit
    • Location & Directions
    • Accessibility
    • Building Access
    • IT Guide
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
link to homepage