Author

Hareshkumar Jadav

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Stronger Spectral Bound for Clique Number

Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral lower bound for the clique number of a graph. Strengthening this bound, Elphick and Wocjan proposed a conjecture in 2018 using positive adjacency eigenvalues. In this paper, we presen...

Hareshkumar Jadav, Sudipta Mallik, Akhilesh Panchangam et al. · 0 citations

#machine learning Preprint Aug 2026

Online Convex Optimization with Dueling Feedback

This work proposes a simple reduction that converts dueling feedback into approximate gradients, enabling the use of standard first-order methods, and shows that regret guarantees transfer under this reduction.

Yi-Yang Lu, Hareshkumar Jadav, M. Pedramfar et al. · 2 citations