Researcher profile

Reza Rastegar

Reza Rastegar contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
7topics
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

Boundary Mass and the Soft-to-Hard Limit in Mixture-of-Experts

Softmax-routed mixture-of-experts models approach hard routing as the temperature tends to zero, but this limit is singular near routing ties. This paper studies that singularity at the population level for squared-loss MoE regression. The central object is the \emph{boundary mass}, namely the probability that the top two router scores are separated by only a small margin. Under smoothness and transversality assumptions on the router and input law, we prove coarea/tube estimates showing that this mass is linear in the slab width, with leading constant given by a surface integral over the routing interface in the binary case. These estimates yield quantitative soft-to-hard risk bounds and, under compactness and uniform margin control, $Γ$-convergence of the soft objectives to the hard-routing objective. The main conclusion is that the zero-temperature limit is controlled by a thin geometric layer around routing interfaces, not by the full input space. We then use this geometric core in two more model-dependent directions. In a teacher--student setting, we prove a conditional landscape-transfer principle showing that, when the profiled hard-routing problem has favorable identifiability and curvature and the relevant derivatives transfer at boundary-layer scale, small-temperature soft routing inherits approximate teacher recovery and strict-saddle behavior away from teacher-equivalent partitions. We also give a reduced two-expert Gaussian calculation that illustrates a local symmetry-breaking mechanism aligned with the teacher separator.

preprint2022arXiv

On a characterization of exponential and double exponential distributions

Recently, G.~Yanev obtained a characterization of the exponential family of distributions in terms of a functional equation for certain mixture densities. The purpose of this note is twofold: we extend Yanev's theorem by relaxing a restriction on the sign of mixture coefficients and, in addition, obtain a similar characterization for the Laplace family of distributions.

preprint2021arXiv

On column-convex and convex Carlitz polyominoes

In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as $n$ grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{9\sqrt{2}(14+3\sqrt{3})}{2704\sqrt{πn^3}}4^n. \feq \item convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{n+1}{10}\left(\frac{3+\sqrt{5}}{2}\right)^{n-2}. \feq \end{enumerate}

preprint2020arXiv

Convex polyominoes revisited: Enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees

The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior vertices, boundary vertices of certain degrees, and outer site perimeter. Using this decomposition, among other things, we show that A) the average number of interior vertices over all convex polyominoes of perimeter $2n$ is asymptotic to $\frac{n^2}{12}+\frac{n\sqrt{n}}{3\sqrtπ} -\frac{(21π-16)n}{12π}.$ B) the average number of boundary vertices with degree two over all convex polyominoes of perimeter $2n$ is asymptotic to $\frac{n+6}{2}+\frac{1}{\sqrt{πn}}+\frac{(16-7π)}{4πn}.$ Additionally, we obtain an explicit generating function counting the number of convex polyominoes with $n$ boundary vertices of degrees at most three and show that this number is asymptotic to $ \frac{n+1}{40}\left(\frac{3+\sqrt{5}}{2}\right)^{n-3} +\frac{\sqrt[4]{5}(2-\sqrt{5})}{80\sqrt{πn}}\left(\frac{3+\sqrt{5}}{2}\right)^{n-2}. $ Moreover, we show that the expected number of the boundary vertices of degree four over all convex polyominoes with $n$ vertices of degrees at most three is asymptotically $ \frac{n}{\sqrt{5}}-\frac{\sqrt[4]{125}(\sqrt{5}-1)\sqrt{n}}{10\sqrtπ}. $ C) the number of convex polyominoes with the outer-site perimeter $n$ is asymptotic to $\frac{3(\sqrt{5}-1)}{20\sqrt{π n}\sqrt[4]{5}}\left(\frac{3+\sqrt{5}}{2}\right)^n,$ and show the expected number of the outer-site perimeter over all convex polyominoes with perimeter $2n$ is asymptotic to $\frac{25n}{16}+\frac{\sqrt{n}}{4\sqrtπ}+\frac{1}{8}.$ Lastly, we prove that the expected perimeter over all convex polyominoes with the outer-site perimeter $n$ is asymptotic to $\sqrt[4]{5}n$.

preprint2019arXiv

On typical triangulations of a convex $n$-gon

Let $f_n$ be a function assigning weight to each possible triangle whose vertices are chosen from vertices of a convex polygon $P_n$ of $n$ sides. Suppose ${\mathcal T}_n$ is a random triangulation, sampled uniformly out of all possible triangulations of $P_n$. We study the sum of weights of triangles in ${\mathcal T}_n$ and give a general formula for average and variance of this random variable. In addition, we look at several interesting special cases of $f_n$ in which we obtain explicit forms of generating functions for the sum of the weights. For example, among other things, we give new proofs for already known results such as the degree of a fixed vertex and the number of ears in ${\mathcal T}_n,$ as well as, provide new results on the number of "blue" angles and refined information on the distribution of angles at a fixed vertex. We note that our approach is systematic and can be applied to many other new examples while generalizing the existing results.

preprint2010arXiv

On the Optimal Convergence Probability of Univariate Estimation of Distribution Algorithms

In this paper, we obtain bounds on the probability of convergence to the optimal solution for the compact Genetic Algorithm (cGA) and the Population Based Incremental Learning (PBIL). We also give a sufficient condition for convergence of these algorithms to the optimal solution and compute a range of possible values of the parameters of these algorithms for which they converge to the optimal solution with a confidence level.