BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Tsogtgerel Gantumur

Tsogtgerel Gantumur appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
math.CAmath.NAMachine Learninghep-lathep-th

Catalog footprint

What is connected

6works
5topics
1close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

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.

Published work

6 published item(s)

preprint2026arXiv

Exact Loop Controllers for ReLU Realization of Homogeneous Curve Refinements

We study homogeneous refinement operators \((Vγ)(t)=\sum_{j\in\mathbb Z}A_jγ(Mt-j)\), acting on compactly supported continuous piecewise linear curves \(γ:\mathbb R\to\mathbb R^p\), where \(M\ge2\) and only finitely many matrices \(A_j\in\mathbb R^{p\times p}\) are nonzero. We prove that the iterates \(V^nγ\) admit exact ReLU realizations of fixed width and depth \(O(n)\). The main new ingredient is an exact loop controller for the residual dynamics. Instead of propagating scalar residual surrogates, the construction transports the residual orbit by a forward-exact state on a polygonal loop. Scalar factors and digit selectors are then recovered from this loop state by complementary CPwL readouts. The loop seam is not removed, but its remaining ambiguity is confined to the final readout/selector stage, where it is harmless because the scalar atom is supported away from the seam. This gives a homogeneous \(M\)-ary vector-valued extension of the scalar binary refinable-function construction with a more geometric controller architecture. We also record crude exponential bounds on the network weights and biases. Affine forcing terms are handled by expanding affine iterates into finite sums of homogeneous iterates, giving exact fixed-width realizations with depth \(O(n^2)\), and anchored open curves reduce to compactly supported defects with affine anchor mismatch. We also describe homogeneous polygonal generators, including dragon-type examples and a self-intersecting Hilbert-type prototype in arbitrary dimension. The extended version includes stage-dependent forcing, finite-state stacking reductions, and further geometric constructions such as Koch-, Gosper-, Morton-, and connector-based Hilbert-type variants.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Exact ReLU realization of tensor-product refinement iterates

We study scalar dyadic refinement operators on R^2 of the form (Vf)(x,y) = sum_{(j,k) in Z^2} c_{j,k} f(2x-j, 2y-k), where only finitely many mask coefficients c_{j,k} are nonzero. Under a fixed support-window hypothesis, we prove that for every compactly supported continuous piecewise linear seed g:R^2->R, the iterates V^n g admit exact ReLU realizations of fixed width and depth O(n). This gives a first genuinely two-dimensional extension of the exact realization theory for refinement cascades. Using the one-dimensional exact loop-controller framework, the proof transports the tensor-product residual dynamics exactly on the product of two polygonal loops and reduces the remaining seam ambiguity to a final readout and selector step. The matrix cascade is then handled by a fixed-depth recursive block, and general compactly supported continuous piecewise linear seeds are reduced to a finite decomposition together with exact clamped gluing on the support window. This identifies the tensor-product dyadic case as a natural first multivariate instance of the loop-controller method for refinement iterates.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Rotationally invariant dynamical lattice regulators for Euclidean quantum field theories

We introduce a dynamical lattice regulator for Euclidean quantum field theories on a fixed hypercubic graph $Λ\simeq\mathbb{Z}^d$, in which the embedding $x:Λ\to\mathbb{R}^d$ is promoted to a dynamical field and integrated over subject to shape regularity constraints. The total action is local on $Λ$, gauge invariant, and depends on $x$ only through Euclidean invariants built from edge vectors (local metrics, volumes, etc.), hence the partition function is exactly covariant under the global special Euclidean group SE(d) at any lattice spacing. The intended symmetry restoring mechanism is not rigid global zero modes but short-range *local twisting* of the embedding that mixes local orientations. Our universality discussion is conditioned on a short-range geometry hypothesis (SR): after quotienting the global SE(d) modes, connected correlators of local geometric observables have correlation length O(1) in lattice units. We prove Osterwalder-Schrader reflection positivity for the coupled system with embedding $x$ and generic gauge and matter fields $(U,Φ)$ in finite volume by treating $x$ as an additional multiplet of scalar fields on $Λ$. Assuming (SR), integrating out $x$ at fixed cutoff yields a local Symanzik effective action in which geometry fluctuations generate only SO(d)-invariant irrelevant operators and finite renormalizations. For example, in d=4 we recover the standard one-loop $β$-function in a scalar $ϕ^4$ test theory. Finally, we describe a practical local Monte Carlo update and report d=2 proof-of-concept simulations showing a well behaved geometry sector and a substantial reduction of axis-vs-diagonal cutoff artefacts relative to a fixed lattice at matched bare parameters.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Convergence rates of adaptive methods, Besov spaces, and multilevel approximation

This paper concerns characterizations of approximation classes associated to adaptive finite element methods with isotropic h-refinements. It is known from the seminal work of Binev, Dahmen, DeVore and Petrushev that such classes are related to Besov spaces. The range of parameters for which the inverse embedding results hold is rather limited, and recently, Gaspoz and Morin have shown, among other things, that this limitation disappears if we replace Besov spaces by suitable approximation spaces associated to finite element approximation from uniformly refined triangulations. We call the latter spaces *multievel approximation spaces*, and argue that these spaces are placed naturally halfway between adaptive approximation classes and Besov spaces, in the sense that it is more natural to relate multilevel approximation spaces with either Besov spaces or adaptive approximation classes, than to go directly from adaptive approximation classes to Besov spaces. In particular, we prove embeddings of multilevel approximation spaces into adaptive approximation classes, complementing the inverse embedding theorems of Gaspoz and Morin. Furthermore, in the present paper, we initiate a theoretical study of adaptive approximation classes that are defined using a modified notion of error, the so-called *total error*, which is the energy error plus an oscillation term. Such approximation classes have recently been shown to arise naturally in the analysis of adaptive algorithms. We first develop a sufficiently general approximation theory framework to handle such modifications, and then apply the abstract theory to second order elliptic problems discretized by Lagrange finite elements, resulting in characterizations of modified approximation classes in terms of memberships of the problem solution and data into certain approximation spaces, which are in turn related to Besov spaces.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

On the convergence theory of adaptive mixed finite element methods for the Stokes problem

In the first part of this paper, we establish a conditional optimality result for an adaptive mixed finite element method for the stationary Stokes problem discretized by the standard Taylor-Hood elements, under the assumption of the so-called general quasi-orthogonality. Optimality is measured in terms of a modified approximation class defined through the total error, as is customary since the seminal work of Cascon, Kreuzer, Nochetto and Siebert. The second part of the paper is independent of optimality results, and concerns interrelations between the modified approximation classes and the standard approximation classes (the latter defined through the energy error). Building on the tools developed in the papers of Binev, Dahmen, DeVore, and Petrushev, and of Gaspoz and Morin, we prove that the modified approximation class coincides with the standard approximation class, modulo the assumption that the data is regular enough in an appropriate scale of Besov spaces.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Adaptive boundary element methods with convergence rates

This paper presents adaptive boundary element methods for positive, negative, as well as zero order operator equations, together with proofs that they converge at certain rates. The convergence rates are quasi-optimal in a certain sense under mild assumptions that are analogous to what is typically assumed in the theory of adaptive finite element methods. In particular, no saturation-type assumption is used. The main ingredients of the proof that constitute new findings are some results on a posteriori error estimates for boundary element methods, and an inverse-type inequality involving boundary integral operators on locally refined finite element spaces.

0 citations0 reviewsNo code linkedOpen access