Source author record

Reza Rastegar

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

7works
7topics
4close collaborators

Published work

7 publications

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.

preprint2021arXiv

On column-convex and convex Carlitz polyominoes

In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as nn grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter 2n2n is \beq \frac{9\sqrt{2}(14+3\sqrt{3})}{2704\sqrt{πn^3}}4^n. \feq \item convex Carlitz polyominoes with perimeter 2n2n 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 2n2n is asymptotic to n212+nn3π−(21π−16)n12π.\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 2n2n is asymptotic to n+62+1πn+(16−7π)4πn.\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 nn boundary vertices of degrees at most three and show that this number is asymptotic to n+140(3+52)n−3+54(2−5)80πn(3+52)n−2. \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 nn vertices of degrees at most three is asymptotically n5−1254(5−1)n10π. \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 nn is asymptotic to 3(5−1)20πn54(3+52)n,\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 2n2n is asymptotic to 25n16+n4π+18.\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 nn is asymptotic to 54n\sqrt[4]{5}n.

preprint2019arXiv

On typical triangulations of a convex nn-gon

Let fnf_n be a function assigning weight to each possible triangle whose vertices are chosen from vertices of a convex polygon PnP_n of nn sides. Suppose Tn{\mathcal T}_n is a random triangulation, sampled uniformly out of all possible triangulations of PnP_n. We study the sum of weights of triangles in Tn{\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 fnf_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 Tn,{\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.

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.