← Search

Sharath Chandra Raparthy

6 accepted papers

2024

GLoRe: When, Where, and How to Improve LLM Reasoning via Global and Local Refinements

ICML 2024poster

State-of-the-art language models can exhibit reasoning refinement capabilities on math, science or coding tasks. However, recent work demonstrates that even the best models struggle to identify *when and where to refine* without access to external feedback. In this paper, we propose Stepwise ORMs (*…

Cited by 52SourcePDFScholar
2024

Generalization to New Sequential Decision Making Tasks with In-Context Learning

ICML 2024poster

Training autonomous agents that can learn new tasks from only a handful of demonstrations is a long-standing problem in machine learning. Recently, transformers have been shown to learn new language or vision tasks without any weight updates from only a few examples, also referred to as in-context l…

Cited by 20SourcePDFScholar
2024

Rainbow Teaming: Open-Ended Generation of Diverse Adversarial Prompts

NeurIPS 2024poster

As large language models (LLMs) become increasingly prevalent across many real-world applications, understanding and enhancing their robustness to adversarial attacks is of paramount importance. Existing methods for identifying adversarial prompts tend to focus on specific domains, lack diversity, o…

Cited by 71SourcePDFScholar
2023

Multi-Objective GFlowNets

ICML 2023poster

We study the problem of generating *diverse* candidates in the context of Multi-Objective Optimization. In many applications of machine learning such as drug discovery and material design, the goal is to generate candidates which simultaneously optimize a set of potentially conflicting objectives. M…

2022

Compositional Attention: Disentangling Search and Retrieval

ICLR 2022spotlight

Multi-head, key-value attention is the backbone of transformer-like model architectures which have proven to be widely successful in recent years. This attention mechanism uses multiple parallel key-value attention blocks (called heads), each performing two fundamental computations: (1) search - sel…

2022

Continual Learning In Environments With Polynomial Mixing Times

NeurIPS 2022accept

The mixing time of the Markov chain induced by a policy limits performance in real-world continual learning scenarios. Yet, the effect of mixing times on learning in continual reinforcement learning (RL) remains underexplored. In this paper, we characterize problems that are of long-term interest to…