Skip to content

Author

Akshay Balsubramani

We have 5 of 46 papers

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.

#machine learning Preprint Oct 2026

Cost-augmented Schr\"odinger bridges on graphs are exactly solvable: a Feynman-Kac tilt replaces learned control

The generalized Schr\"odinger bridge on a graph moves mass between two distributions while charging a cost for the states visited. It has been approached by learning the rates of a controlled continuous-time Markov chain, with a temporal-difference penalty that restores the cost. A state cost folds into the reference p...

Akshay Balsubramani · 0 citations
#machine learning Preprint Sep 2026

Exact information accounting for SGD methods

As an alternative to the standard geometric analyses, we give an exact, information-theoretic analysis of stochastic gradient descent (SGD) and its variants. We show that a preconditioned SGD step is the posterior-mean update of a Gaussian Bayes model, and that its one-step regret splits into an intrinsic-time cost and...

Akshay Balsubramani · 0 citations
Preprint Sep 2026

An information identity reveals the geometry of deviation events

In a deviation event, the empirical measure of $n$ independent draws lands in a set of distributions. The exponent of its probability splits, at every $n$, into two nonnegative terms. The first is the rate: $n$ times the relative entropy, from the population, of the distribution of a typical draw under the event. The s...

Akshay Balsubramani · 0 citations
Preprint Aug 2026

Information on trajectories: martingales and random times

Accounting for information flow on the path space of trajectories of a nonnegative martingale yields exact variational identities for it, even at arbitrary random times. This recovers the widely used classical concentration inequalities, from Ville to PAC-Bayes, and measures what each one discards. The tail a bound con...

Akshay Balsubramani · 0 citations
#machine learning Preprint Aug 2026

The concentration game: Bayesian updating, regret, and information

A two-player zero-sum repeated game between a learner and nature whose value identity generates Bayesian updating and an exact accounting of exponential-weights regret at once is given, and supplies the comparator-class variational form that a wide class of concentration phenomena share.

Akshay Balsubramani · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.