Searcharxiv⌕ Search

arXiv subjects

Viet-Hoang Tran

Publications and source records attributed to Viet-Hoang Tran.

At least 19 recordsLinked to original sources

Conformal Prediction for Distribution-to-Distribution Regression

Conformal Prediction (CP) provides a model-agnostic framework for constructing finite-sample prediction sets with coverage guarantees and has become a tool for reliable decision-making in high-risk settings. Recent advances have extended Split Conformal Prediction to increasingly complex learning problems, including multilabel, high-dimensional, and functional outputs. In this work, we study CP for Distribution-to-Distribution Regression, a setting of growing interest across many application domains. We show that a naive application of Split CP yields prediction sets that, while marginally valid, are non-interpretable, e.g., lacking a well-defined volume or a tractable sampling procedure, and of limited practical value. To overcome this, we propose a new conformal framework that operates in an orthogonal basis space, producing interpretable prediction sets while preserving coverage guarantees. We further develop an adaptive variant with asymptotic conditional coverage under mild assumptions. Empirical results on synthetic and real-world datasets validate the effectiveness of the proposed approach. The code is publicly available at https://github.com/tuanhacs/conformal_d2d.

cs.LG↗

Dimensions of a ring and its formal power series ring

Understanding the relation between $\dim R$ and $\dim R[[x]]$ is a classical problem in commutative algebra. For a Noetherian ring $R$, one has $\dim R[[x]]=\dim R+1$, but the general case is considerably more delicate. In 1973, Arnold proved that finite power-series dimension requires the strong finite type (SFT) condition, whereas, in 2002, Coykendall constructed a one-dimensional SFT domain whose power series ring has infinite dimension. The question of Coykendall and Gilmer whether $\dim R[[x]]<\infty$ forces $\dim R[[x]]\le2\dim R+1$ was answered negatively by Kang and Park in 2009. In this paper, we prove that, as $R$ ranges over the nonzero commutative rings with identity, the finite pairs $(\dim R,\dim R[[x]])$ are exactly $(0,1)$ and the pairs $(n,m)$ with $1\le n<m$.

math.AC↗

Bouvier's Conjecture and Dimension Sequences of Unique Factorization Domains

We prove Bouvier's conjecture. More generally, an integer sequence $(a_n)_{n \ge 0}$ with $a_0=d \ge 0$ is realized by a unique factorization domain (UFD) $R$ with $\dim R[X_1,\ldots,X_n]=a_n$ for every $n \ge 0$ if and only if $$ a_n+1\le a_{n+1} \le a_n+\left\lfloor\frac{a_n+1}{n+1}\right\rfloor \qquad(n\ge0) $$ and $a_1 \le 2d$ whenever $d \ge 1$.

math.AC↗

On the Krull dimensions of rings of integer-valued polynomials and polynomial rings

It was conjectured that every integral domain $D$ satisfies $\dim\operatorname{Int}(D) \leq \dim D[X]$. We disprove this conjecture and, more strongly, classify all pairs for which both dimensions are finite. Writing $m=\dim D[X]$ and $n=\dim\operatorname{Int}(D)$, the pairs that occur are precisely $\{(1,1),(2,2)\}\ \cup\ \{(m,n)\in\mathbb Z_{>0}^{2}:m\geq3,\ n\geq m-1\}$.

math.AC↗

A Reduced Non-McCoy Ring with the Annihilator Condition and $(A_2)$

It has been asked whether a reduced non-McCoy ring can satisfy both the annihilator condition and $(A_n)$ for some $n \geq 2$. In this work, we prove that such rings exist exactly when $n=2$, by constructing a countable example and showing that the annihilator condition together with $(A_3)$ forces a ring to be McCoy.

math.AC↗

Alternating Divisoriality of Prime Ideals along Infinite Chains of Bézout Domains

A question posed in the literature asks whether the divisoriality of a prime can alternate indefinitely along an ascending chain of overrings of a Prüfer domain or a descending chain of same-quotient-field underrings, and what happens at the limit. We construct such chains with all finite-stage domains Bézout and show, in both directions, that the limit prime can be either divisorial or nondivisorial.

math.AC↗

Polynomial extensions do not preserve the strong finite type property

Arnold introduced the strong finite type (SFT) property in 1973 while studying the dimension of power series rings. For several classes of rings, polynomial extension is known to preserve the SFT property, but the general question remained open. We answer it negatively by constructing an SFT ring $R$ such that $R[X]$ is not SFT.

math.AC↗

The Noetherian Case of Bayart's Power-Series Question

Let $R$ be a commutative Noetherian ring. We prove that if the one-variable formal power-series ring $R[[x]]$ is a unique factorization domain, then so is the two-variable formal power-series ring $R[[x,y]]$. This resolves a question raised by Bayart in 1973 for Noetherian coefficient rings. The proof uses the divisor theory of Noetherian normal domains, expressed through finite rank-one reflexive modules.

math.AC↗

Geometric and Stochastic Analysis of Discontinuities in Sparse Mixture-of-Experts

Sparse Mixture-of-Experts (SMoE) architectures are now widely deployed in state-of-the-art language and vision models, where conditional routing allows scaling to very large networks. However, this very Top-$k$ expert selection that enables conditional routing also renders the SMoE map inherently discontinuous. In the vicinity of these discontinuity surfaces, even inputs that are arbitrarily close may activate substantially different sets of experts resulting in significantly different outputs. In this work we give a rigorous geometric and stochastic analysis of these discontinuities. We first classify them by order, determined by the number of tied experts at a switching event. Using measure-theoretic slicing arguments, we establish asymptotic volume estimates for the thickened discontinuity surfaces, showing that lower-order discontinuity sets dominate, whereas higher-order ones occupy a vanishingly small relative volume. Next, modeling random perturbations in the input space via a diffusion process, we prove that the path eventually encounter a discontinuity, and moreover that the first hit almost surely occurs on an order-1 discontinuity with explicit finite-time probability bounds. We further derive occupation-time bounds that quantify the duration the random path spend in the neighborhoods of each discontinuity order. These theoretical results imply that inputs are more likely to lie near lower order discontinuities. Motivated by this insight, we propose a simple smoothing mechanism that can be directly applied to existing SMoEs, softly incorporating experts near discontinuities; our analysis guarantees that the added computational overhead remains small while providing localized smoothing near discontinuities, and experiments across language and vision tasks show that smoothing not only enforces continuity of the SMoE map but also enhances empirical performance.

cs.LG↗

Conservation Laws for Modern Neural Architectures

Understanding gradient descent dynamics is key to explaining the success of over-parameterized models, where implicit bias manifests through conservation laws in gradient flow. While such laws are well understood for linear and ReLU networks, they remain largely unexplored for modern architectures. This work develops a unified framework to characterize conservation laws for contemporary models, including feedforward networks with GELU, SiLU, and SwiGLU activations, multihead attention with sinusoidal and rotary positional encodings, and Mixture-of-Experts architectures under diverse gating designs. Our theoretical findings are supported by experiments that validate the predicted invariants.

cs.LG↗

Functional Equivalence in Attention: A Comprehensive Study with Applications to Linear Mode Connectivity

Neural network parameter spaces are inherently non-injective, as distinct parameter configurations can realize identical functions through functional equivalence. While this symmetry is well understood in classical fully connected and convolutional models, it becomes substantially more intricate in modern attention-based architectures. Existing analyses of multihead attention have largely focused on the vanilla formulation, overlooking positional encodings that fundamentally reshape architectural symmetries. In this work, we provide a formal study of functional equivalence in Transformers with positional encodings. Focusing on the two most widely used variants--sinusoidal and rotary positional encodings (RoPE)--we show that sinusoidal encodings preserve the equivalence structure of vanilla attention, whereas rotary encodings significantly reduce the symmetry group, thereby enhancing expressivity. This offers a principled explanation for the growing prominence of RoPE in practice. We further examine how positional encodings affect linear mode connectivity, and through an alignment algorithm, empirically demonstrate that the presence and variability of connectivity across Transformer settings crucially depend on the positional encoding.

cs.LG↗

Quasi-Equivariant Metanetworks

Metanetworks are neural architectures designed to operate directly on pretrained weights to perform downstream tasks. However, the parameter space serves only as a proxy for the underlying function class, and the parameter-function mapping is inherently non-injective: distinct parameter configurations may yield identical input-output behaviors. As a result, metanetworks that rely solely on raw parameters risk overlooking the intrinsic symmetries of the architecture. Reasoning about functional identity is therefore essential for effective metanetwork design, motivating the development of equivariant metanetworks, which incorporate equivariance principles to respect architectural symmetries. Existing approaches, however, typically enforce strict equivariance, which imposes rigid constraints and often leads to sparse and less expressive models. To address this limitation, we introduce the novel concept of quasi-equivariance, which allows metanetworks to move beyond the rigidity of strict equivariance while still preserving functional identity. We lay down a principled basis for this framework and demonstrate its broad applicability across diverse neural architectures, including feedforward, convolutional, and transformer networks. Through empirical evaluation, we show that quasi-equivariant metanetworks achieve good trade-offs between symmetry preservation and representational expressivity. These findings advance the theoretical understanding of weight-space learning and provide a principled foundation for the design of more expressive and functionally robust metanetworks.

cs.LG↗

Equivariant Polynomial Functional Networks

Neural Functional Networks (NFNs) have gained increasing interest due to their wide range of applications, including extracting information from implicit representations of data, editing network weights, and evaluating policies. A key design principle of NFNs is their adherence to the permutation and scaling symmetries inherent in the connectionist structure of the input neural networks. Recent NFNs have been proposed with permutation and scaling equivariance based on either graph-based message-passing mechanisms or parameter-sharing mechanisms. However, graph-based equivariant NFNs suffer from high memory consumption and long running times. On the other hand, parameter-sharing-based NFNs built upon equivariant linear layers exhibit lower memory consumption and faster running time, yet their expressivity is limited due to the large size of the symmetric group of the input neural networks. The challenge of designing a permutation and scaling equivariant NFN that maintains low memory consumption and running time while preserving expressivity remains unresolved. In this paper, we propose a novel solution with the development of MAGEP-NFN (Monomial mAtrix Group Equivariant Polynomial NFN). Our approach follows the parameter-sharing mechanism but differs from previous works by constructing a nonlinear equivariant layer represented as a polynomial in the input weights. This polynomial formulation enables us to incorporate additional relationships between weights from different input hidden layers, enhancing the model's expressivity while keeping memory consumption and running time low, thereby addressing the aforementioned challenge. We provide empirical evidence demonstrating that MAGEP-NFN achieves competitive performance and efficiency compared to existing baselines.

cs.LG↗

Dynamical Properties of Tokens in Self-Attention and Effects of Positional Encoding

This paper investigates the dynamical properties of tokens in pre-trained Transformer models and explores their application to improving Transformers. To this end, we analyze the dynamical system governing the continuous-time limit of the pre-trained model and characterize the asymptotic behavior of its solutions. Specifically, we characterize when tokens move closer to or farther from one another over time, depending on the model parameters. We provide sufficient conditions, based on these parameters, to identify scenarios where tokens either converge to zero or diverge to infinity. Unlike prior works, our conditions are broader in scope and more applicable to real-world models. Furthermore, we investigate how different forms of positional encoding -- specifically absolute and rotary -- affect these dynamical regimes. Empirical evidence reveals that the convergence scenario adversely impacts model performance. Motivated by these insights, we propose simple refinements to Transformer architectures that mitigate convergence behavior in models with absolute or rotary positional encoding. These findings support theoretical foundations and design principles for improving Transformer models.

cs.LG↗