Source author record

Rikhav Shah

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record

Catalog footprint

Research overview

3works
6topics
4close collaborators

Published work

3 publications

preprint2026arXiv

DynMuon: A Dynamic Spectral Shaping View of Muon

In recent years, Muon has emerged as the dominant method for training large language models, and transformers more broadly. The essential difference, when compared to standard gradient descent methods, is to replace the usual update matrix M=UΣV⊤M=UΣV^\top with its polar factor UV⊤UV^\top. In this work, we consider a class of Muon-like updates, where we replace the update MM with UΣpV⊤UΣ^p V^\top for some parameter pp. We call this a "spectral-shaping" operation, and develop a theory of how to pick pp which depends on (a) local curvature of the loss function, (b) noise stemming from stochastic gradients and label noise, and (c) training stage. Our theory and experimentation reveal a previously overlooked behavior: positive pp helps early by emphasizing high-curvature directions and accelerating signal contraction, while mildly negative pp helps later by reallocating update strength toward low-curvature directions that still contain useful training signals. Building on the insight, we propose DynMuon, an efficient dynamic spectral shaping method that schedules pp from positive to mildly negative over training. Extensive experiments across model sizes, architectures, and training settings show that DynMuon consistently achieves lower validation loss than Muon, while requiring 10.6-26.5% fewer steps to reach the same target loss.

preprint2022arXiv

Determinants of binary matrices achieve every integral value up to Ω(2n/n)Ω(2^n/n)

This work shows that the smallest natural number dnd_n that is not the determinant of some n×nn\times n binary matrix is at least c 2n/nc\,2^n/n for c=1/201c=1/201. That same quantity naturally lower bounds the number of distinct integers DnD_n which can be written as the determinant of some n×nn\times n binary matrix. This asymptotically improves the previous result of dn=Ω(1.618n)d_n=Ω(1.618^n) and slightly improves the previous result of Dn≥2n/g(n)D_n\ge 2^n/g(n) for a particular g(n)=ω(n2)g(n)=ω(n^2) function.

preprint2018arXiv

Directed Random Geometric Graphs

Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many others. The challenge, however, is to create a network model that has many of the properties of real-world networks such as powerlaw degree distributions and the small-world property. To meet these challenges, we introduce the \textit{Directed} Random Geometric Graph (DRGG) model, which is an extension of the random geometric graph model. We prove that it is scale-free with respect to the indegree distribution, has binomial outdegree distribution, has a high clustering coefficient, has few edges and is likely small-world. These are some of the main features of aforementioned real world networks. We empirically observe that word association networks have many of the theoretical properties of the DRGG model.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.