Skip to content

Author

B. T. Nguyen

We have 6 of 8 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Arithmetic Scar Accessibility and Generic Schrodinger Control on Metric Graphs

We study internal exact controllability of the free Schr\"odinger equation on finite compact metric graphs with Kirchhoff conditions at interior vertices and a fixed Dirichlet-Neumann assignment at exterior vertices. For a prescribed primitive cycle or exterior-to-exterior path, we identify an arithmetic criterion ensu...

B. T. Nguyen · 0 citations
Preprint Aug 2026

Uniform Non-Localization under Robin Boundary Perturbations: Spectral Splitting and Bounded Eigenspace Complexity

We study the high-energy spectral effect of Robin boundary perturbations on complete Laplace eigenspaces and its consequences for eigenfunction non-localization. Highly degenerate Neumann levels generally split under Robin perturbation, but this splitting need not produce a simple spectrum: distinct modal classes may s...

B. T. Nguyen · 0 citations
Preprint Sep 2026

Uniform High-Frequency Localization on Quantum Graphs

We study uniform high-frequency localization for the Laplacian on compact metric graphs through the least $L^2$-mass that eigenfunctions must place in a prescribed measurable observation set. We first identify this asymptotic localization constant with the minimum of a linear functional over the attainable edge-intensi...

B. T. Nguyen · 0 citations
Preprint Oct 2026

Curvature, Scaling, and Complexity in Riemannian Projection-Free Optimization

Projection-free methods replace projections by linear minimization oracles, making their convergence fundamentally sensitive to the geometry of the feasible region. We develop a geometric framework for this dependence in Riemannian Frank--Wolfe optimization. A power-type double-geodesic modulus quantifies the intrinsic...

B. T. Nguyen · 0 citations
Preprint Sep 2026

Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification

We study the nonconvex trust-region subproblem by a certificate-coupled difference-of-convex algorithm that incorporates spectral information before exact first-order stationarity is attained. The method maintains a persistent randomized Krylov subspace together with the DCA iterates. Near stationarity, a sufficiently...

B. T. Nguyen · 0 citations
#machine learning Preprint Aug 2026

Logarithmic-Free Moment and Generalization Bounds for Uniformly Stable Algorithms

Uniform stability is a classical tool for controlling the generalization error of a learning algorithm. Bousquet, Klochkov, and Zhivotovskiy (2020) showed that the problem can be reduced to a moment inequality for a sum of weakly interacting functions of independent random variables. Their bound contains an additional...

Thanh Nguyen-Cung, B. T. Nguyen · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.