5 papers
Stronger Spectral Bound for Clique Number
Hareshkumar Jadav, Sudipta Mallik, Akhilesh Panchangam +1
Given an integer , deciding whether a graph has a clique of size is an NP-complete problem. Wilf's inequality provides a spectral lower bound for the clique number of a grap…
Online Convex Optimization with Dueling Feedback
Yiyang Lu, Hareshkumar Jadav, Mohammad Pedramfar +2
Noisy binary comparison between two candidates is a common interface between human and learning systems, especially in modern large language model (LLM) post-training alignment. We…
Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
Hareshkumar Jadav, Ranveer Singh, Vaneet Aggarwal
Maximizing submodular objectives under constraints is a fundamental problem in machine learning and optimization. We study the maximization of a nonnegative, non-monotone -weakl…
Cartesian Prime Graphs and Cospectral Families
Abhinav Bitragunta, Hareshkumar Jadav, Ranveer Singh
We introduce a method for constructing larger families of connected cospectral graphs from two given cospectral families of sizes and . The resulting family size depends on…
Strengthening Wilf's lower bound on clique number
Hareshkumar Jadav, Sreekara Madyastha, Rahul Raut +1
Given an integer , deciding whether a graph has a clique of size is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graph…