BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Siva Athreya

Siva Athreya contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
math.PRMachine Learningmath.CV

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
3topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

7 published item(s)

preprint2026arXiv

Adynamical systems view of training generativemodels and the memorization phenomenon

Using recent works of one of the authors (VSB) on collapse in generative models and two time scale dynamics in stochastic gradient descent in high dimensions, we give a system theoretic explanation of the memorization phenomenon in generative models. This relies purely on the dynamic aspects of the training phase. Specifically, we use a result of Austin [2016] to motivate a stylized model for the loss function for stochastic gradient descent (SGD) wherein the loss function has a strong dependence on some variables and weak dependence on the rest in a precise sense. This naturally leads to two distinct time scales in the constant step size SGD that is commonly used in machine learning. This fact has been used to explain the double descent phenomenon in SGD in Borkar [2026]. In conjunction with a mathematical model for collapse phenomenon in SGD developed in Borkar [2025a], we analyze the constant step size SGD using the recent results of Azizian et al. [2024] in order to explain the phenomenon of memorization wherein a generative model that is concurrently being tuned yields the same or similar outputs for significant stretches of time. This gives a novel perspective on the aforementioned phenomena reported in machine learning literature and their interrelationships, using a dynamical systems viewpoint.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Volume Approximation of Strongly ${\mathbb C}$-Convex Domains by Random Polyhedra

Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has been obtained. In this article, we take these studies further by investigating polyhedra constructed using random points (Poisson or binomial process) on the boundary of a strongly $\mathbb{C}$-convex domain. We determine the rate of error in volume approximation of the domain by random polyhedra, and conjecture the precise value of the minimal limiting constant. Analogous to the real case, the exponent appearing in the error rate of random volume approximation coincides with that of optimal volume approximation, and can be interpreted in terms of the Hausdorff dimension of a naturally-occurring metric space. Moreover, the limiting constant is conjectured to depend on the Möbius-Fefferman measure, which is a complex analogue of the Blaschke surface area measure. Finally, we also prove $L^1$-convergence, variance bounds, and normal approximation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Well-posedness of stochastic heat equation with distributional drift and skew stochastic heat equation

We study stochastic reaction--diffusion equation $$ \partial_tu_t(x)=\frac12 \partial^2_{xx}u_t(x)+b(u_t(x))+\dot{W}_{t}(x), \quad t>0,\, x\in D $$ where $b$ is a generalized function in the Besov space $\mathcal{B}^β_{q,\infty}({\mathbb R})$, $D\subset{\mathbb R}$ and $\dot W$ is a space-time white noise on ${\mathbb R}_+\times D$. We introduce a notion of a solution to this equation and obtain existence and uniqueness of a strong solution whenever $β-1/q\ge-1$, $β>-1$ and $q\in[1,\infty]$. This class includes equations with $b$ being measures, in particular, $b=δ_0$ which corresponds to the skewed stochastic heat equation. For $β-1/q > -3/2$, we obtain existence of a weak solution. Our results extend the work of Bass and Chen (2001) to the framework of stochastic partial differential equations and generalizes the results of Gyöngy and Pardoux (1993) to distributional drifts. To establish these results, we exploit the regularization effect of the white noise through a new strategy based on the stochastic sewing lemma introduced in Lê~(2020).

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Small ball probabilities and a support theorem for the stochastic heat equation

We consider the following stochastic partial differential equation on $t \geq 0, x\in[0,J], J \geq 1$ where we consider $[0,J]$ to be the circle with end points identified: \begin{equation*} \partial_t{\mathbf u}(t,x) =\frac{1}{2}\,\partial_x^2 {\mathbf u}(t,x) + {\mathbf g}(t,x,\mathbf u) + {\mathbf σ}(t,x, {\mathbf u})\dot {\mathbf W}(t,x) , \end{equation*} and $\dot {\mathbf W }(t,x)$ is 2-parameter $d$-dimensional vector valued white noise and ${\mathbf σ}$ is function from ${\mathbb R}_+\times {\mathbb R} \times {\mathbb R}^d \rightarrow {\mathbb R}^d$ to space of symmetric $d\times d$ matrices which is Lipschitz in $\mathbf u$. We assume that $σ$ is uniformly elliptic and that $\mathbf g$ is uniformly bounded. Assuming that ${\mathbf u}(0,x) \equiv \mathbf 0$, we prove small-ball probabilities for the solution $\mathbf u$. We also prove a support theorem for solutions, when ${\mathbf u}(0,x)$ is not necessarily zero.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

S.L.L.N. and C.L.T. for Random Walks in I.I.D. Random Environment on Cayley Trees

We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a regular tree. Under a uniform elipticity assumption on the i.i.d. environment we show that the walk has positive speed and establish the annealed central limit theorem for the graph distance of the walker from the starting point.

0 citations0 reviewsNo code linkedOpen access