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
  • 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

Error message

Could not retrieve the oEmbed resource.

Results 441 - 450 of 24335

Video
|
May 29, 2026
Prospects for Quantum Advantage in Chemistry - near term and long term
Video
|
May 29, 2026
Quantum advantage in quantum simulation in the age of classical simulation
Video
|
May 29, 2026
Coupled quantum-classical dynamics in the Liouvillian framework
Video
|
May 29, 2026
Barriers to dequantization of near-term molecular electronic structure methods
Video
|
May 29, 2026
Observation of Improved Accuracy over Classical Sparse Ground State Solvers using a Quantum Computer
Video
|
May 29, 2026
Dimensionality Reduction Methods for Quantum Simulation of Chemical Processes
Video
|
May 29, 2026
Leveraging Low-Energy Assumptions for Quantum Speedups
Research Program
|
Summer 2025
Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation
Workshop Talk
|
May 28, 2026

Length Generalization via Auxiliary Tasks

Length generalization, the ability of sequence models to generalize to sequences longer than those encountered during training, remains a key challenge for transformers, especially in tasks requiring algorithmic reasoning. Existing theoretical understanding of length generalization is limited, often providing only asymptotic results or focusing on specific problem classes or architectural variants, while empirical approaches frequently rely on ad hoc and often fragile techniques.

In this work we introduce a novel framework for analyzing and proving length generalization bounds under specified, verifiable assumptions. A key outcome of the theory is the identification of a natural set of auxiliary tasks, intricately related to the primary task structure, such that strong performance on these auxiliary tasks, alongside the primary task, provably guarantees length generalization within the framework. This motivates a multi-task training procedure that explicitly optimizes performance on both the primary and the identified auxiliary tasks.

Empirical evaluations on a variety of synthetic benchmarks known to be challenging for length generalization, including sequence sorting, and reversal, demonstrate that our proposed method yields significant improvements in generalization to substantially longer sequences.

Workshop Talk
|
May 28, 2026

Trust Without Transparency

As machine learning systems become larger and more opaque, our relationship to them increasingly shifts from inspection to interaction. We evaluate, audit, benchmark, red-team, and delegate to systems whose internal behavior we cannot fully characterize. This may seem like a new challenge created by modern AI, but in many ways it is deeply aligned with longstanding themes in theoretical computer science.

This talk argues, through examples drawn from privacy auditing and delegation in principal-agent settings, that many areas of TCS can be viewed as studying reliable interaction with black boxes under limited observability. The goal is not always to open the black box, but to understand what guarantees remain possible when we cannot.

Pagination

  • Previous page Previous
  • Page 43
  • Page 44
  • Current page 45
  • Page 46
  • Page 47
  • 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
  • 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