Papers by Rajarshi Roy
Constrained Decoding with Speculative Lookaheads (2025.naacl-long)
Copied to clipboard
Nishanth Sridhar Nakshatri, Shamik Roy, Rajarshi Das, Suthee Chaidaroon, Leonid Boytsov, Rashmi Gangadharaiah
| Challenge: | Constrained decoding with lookahead heuristics is effective for aligning LLM generations to human preferences, but the extensive lookaheaded roll-out operations for each generated token make it prohibitively expensive. |
| Approach: | They propose a technique that uses lookaheads to align LLMs to human preferences . they propose 2.2x to 12.15x speedup over greedy decoding . |
| Outcome: | The proposed technique achieves 2.2x to 12.15x speedup over greedy decoding without significant performance reduction. |
DPO Kernels: A Semantically-Aware, Kernel-Enhanced, and Divergence-Rich Paradigm for Direct Preference Optimization (2025.findings-acl)
Copied to clipboard
Amitava Das, Suranjana Trivedy, Danush Khanna, Yaswanth Narsupalli, Basab Ghosh, Rajarshi Roy, Gurpreet Singh, Vinija Jain, Vasu Sharma, Aishwarya Naresh Reganti, Aman Chadha
| Challenge: | Direct Preference Optimization (DPO) is a cornerstone for preference alignment but is constrained by fixed divergence measures and limited feature transformations. |
| Approach: | They propose a new enhancement of Direct Preference Optimization that integrates kernel methods to overcome these challenges. |
| Outcome: | The proposed model improves divergence measures and features by using kernels . the proposed model achieves state-of-the-art generalization in factuality, safety, reasoning, and instruction following . |