The paper shows deep connections between exotic smoothings of small R^4, noncommutative algebras of foliations and quantization. At first, based on the close relation of foliations and noncommutative C*-algebras we show that cyclic cohomology invariants characterize some small exotic R^4. Certain exotic smooth R^4's de…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “smoothing factors”
Deep weight factorization improves neural network training through smooth optimization of sparse penalties.
problem Challenges in applying sparse regularization in neural networks due to non-differentiability of penalties.
method Introduces deep weight factorization, decomposing weights into multiple factors for smooth optimization of -penalized networks.
result Deep weight factorization outperforms shallow factorization and pruning methods consistently across various architectures and datasets.
A new tensor model captures complex structures in heterogeneous data.
problem Complex joint and discriminative structures in heterogeneous datasets.
method Double core tensor factorization with smoothing loss functions and linearized ADMM.
result The model accurately estimates factors even with missing entries.
GLSKF improves tensor completion by capturing both global and local variations.
problem Tensor completion with missing entries, especially in data with spatial or temporal side information.
method Integrates smoothness-constrained low-rank factorization with a locally correlated residual process.
result GLSKF achieves superior performance and scalability on real-world datasets.
Study shows how Poisson brackets factor on infinite dimensional manifolds.
problem Understanding Poisson brackets on infinite dimensional manifolds.
method Analyzes Poisson brackets on smoothly paracompact manifolds with specific properties.
result Dual map of a Poisson bracket factors as a smooth section of a vector bundle.
We show that on a closed smooth manifold equipped with fiber bundle structures whose vertical distributions span the tangent bundle, every smooth diffeomorphism of sufficiently close to the identity can be written as a product , where preserves the -fiber. The factors …
Method regularizes Cholesky factors to detect nonstationarity in longitudinal data.
problem Detecting nonstationarity in large covariance matrices of longitudinal data.
method Fused-Lasso regularization on Cholesky factors.
result Regularization leads to smooth subdiagonals, indicating nonstationarity.
Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformati…
Researchers develop weighted GJMS operators for smooth metric measure spaces.
problem Developing mathematical tools for smooth metric measure spaces.
method Constructing and proving formal self-adjointness of weighted GJMS operators.
result Formal self-adjointness of weighted GJMS operators proved.
TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.
problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.
New RBF networks can approximate any continuous function.
problem Approximating any continuous function on a compact subset.
method Replacing smoothing factors with shifts in RBF networks and proving approximation under certain conditions.
result RBF networks can approximate any continuous function on any compact subset.
Positive factorization for pseudoperiodic homeomorphisms on surfaces.
problem Factorization of pseudoperiodic homeomorphisms on surfaces.
method Generalization of classical results on smooth germs of surfaces, topological characterization of monodromies, and use of positive factorization criteria.
result Pseudoperiodic homeomorphisms on surfaces with positive fractional Dehn twist coefficients and screw numbers admit a positive factorization.
SATL adapts to varying smoothness in hypothesis transfer learning.
problem Fixed kernel regularization fails in varying smoothness settings.
method Proposes SATL, a two-phase KRR algorithm with adaptive Gaussian kernels.
result SATL achieves minimax optimality with matching upper and lower bounds.
New algorithms SVCA and SSPA improve robustness to noise in nonnegative matrix factorization.
problem Estimating vertices from noisy data points in convex hull.
method Smoothed VCA (SVCA) and Smoothed SPA (SSPA) algorithms.
result Improved robustness to noise compared to existing methods.
This short report establishes some basic properties of smooth vector fields on product manifolds. The main results are: (i) On a product manifold there always exists a direct sum decomposition into horizontal and vertical vector fields. (ii) Horizontal and vertical vector fields are naturally isomorphic to smooth famil…
In modeling multivariate time series, it is important to allow time-varying smoothness in the mean and covariance process. In particular, there may be certain time intervals exhibiting rapid changes and others in which changes are slow. If such time-varying smoothness is not accounted for, one can obtain misleading inf…
We consider semidefinite programs (SDPs) of size n with equality constraints. In order to overcome scalability issues, Burer and Monteiro proposed a factorized approach based on optimizing over a matrix Y of size by such that is the SDP variable. The advantages of such formulation are twofold: the di…
In the framework of Lorentzian warped products, we study the Friedmann-Robertson-Walker cosmological model to investigate non-smooth curvatures associated with multiple discontinuities involved in the evolution of the universe. In particular we analyze non-smooth features of the spatially flat Friedmann-Robertson-Walke…
Approximation and learning of anisotropic and mixed smooth functions by deep ReLU neural networksstat.ML
Deep ReLU networks can approximate and learn smooth functions efficiently.
problem Efficiently approximating and learning smooth functions using deep ReLU neural networks.
method Extending recent results to anisotropic and mixed smooth function classes, establishing approximation rates.
result Deep ReLU networks achieve minimax optimal rates up to logarithmic factors for various smooth function classes.
High-dimensional smoothing techniques struggle with robustness guarantees against various attacks.
problem Challenges in extending randomized smoothing to other attack models in high-dimensional space.
method Analysis of isotropic and generalized Gaussian smoothing distributions, proving bounds on certified robustness radii.
result Certifiable robustness radii decrease as $O(1/d^{ rac{1}{2} - rac{1}{p}})$ with dimension for .
New methods optimize functions on hyperbolic and spherical spaces, matching Euclidean rates up to logarithmic factors.
problem Optimizing functions on non-Euclidean spaces like hyperbolic and spherical geometries.
method Introduced accelerated global first-order methods for -smooth and geodesically convex functions on hyperbolic and spherical spaces.
result Achieved the same rates as accelerated gradient descent in Euclidean space, up to logarithmic factors.
A smooth map between smooth manifolds is called a special generic map if it has only definite fold points as its singularities. In this paper, we give conditions for a special generic map into the 3-dimensional Euclidean space to be factored as the composition of an embedding and a projection for certain dimensions.
Prediction of dynamical time series with additive noise using support vector machines or kernel based regression has been proved to be consistent for certain classes of discrete dynamical systems. Consistency implies that these methods are effective at computing the expected value of a point at a future time given the …
We consider actions of non-compact simple Lie groups preserving an analytic rigid geometric structure of algebraic type on a compact manifold. The structure is not assumed to be unimodular, so an invariant measure may not exist. Ergodic stationary measures always exist, and when such a measure has full support, we show…
Adaptive NN method improves matrix completion for non-smooth data.
problem Matrix completion with non-smooth non-linear functions under high missingness.
method Two-sided nearest neighbors with \Holder function class non-linearity.
result NN error rate matches oracle's for latent factors, non-trivial for wide range of missingness.
Beyond perturbation 2: asymptotics and Beilinson-Drinfeld Grassmannians in differential geometrymath.DG
We prove that for any k greater or equal to 2, given a smooth compact k-dimensional manifold and a multiplicative k-1-gerbe on a Lie group, together with an integrable connection, there is a line bundle on the corresponding Beilinson-Drinfeld Grassmannian having the factorization property. We show that taking global se…
Lipschitz and horizontal maps from an -dimensional space into the -dimensional Heisenberg group $\H^n$ are abundant, while maps from higher-dimensional spaces are much more restricted. DeJarnette-Hajłasz-Lukyanenko-Tyson constructed horizontal maps from to $\H^n$ which factor through -spheres and sh…
Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field K of characteristic zero is a composite of blowings up and blowings down with sm…
We propose algorithms for approximate filtering and smoothing in high-dimensional Factorial hidden Markov models. The approximation involves discarding, in a principled way, likelihood factors according to a notion of locality in a factor graph associated with the emission distribution. This allows the exponential-in-d…
Non-negative matrix factorization (NMF) approximates a non-negative matrix by a product of two non-negative low-rank factor matrices and . NMF and its extensions minimize either the Kullback-Leibler divergence or the Euclidean distance between and to model the Poisson noise or the Gaussian noise.…
Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…
Paper develops a discounted algorithm for online convex optimization that adapts to unknown discount factors.
problem Developing an algorithm that can adapt to an unknown discount factor in online convex optimization.
method Smoothed Online Gradient Descent (SOGD) with Discounted-Normal-Predictor (DNP).
result Achieves a uniform discounted regret across a continuous interval of discount factors.
High-dimensional models trained on smooth manifolds achieve optimal rates in Wasserstein metrics.
problem Training score-based generative models on complex, low-dimensional manifolds.
method Proves optimal rates for SGMs on smooth manifolds, separating into noise regimes and using ReLU nearest-projection coordinates.
result Optimal intrinsic Wasserstein rates are achieved, with polynomial ambient dependence for families with controlled geometry and density.
Study forward investment performance in semimartingale markets with stochastic factors.
problem Investigate forward investment performance in incomplete semimartingale markets with power risk preferences and stochastic integrated factors.
method Develop necessary and sufficient conditions for FIPP existence, use integral representations, and solve ill-posed HJB equations.
result Explicit constructions for time-monotone FIPPs in semimartingale models, generalizing from Brownian to semimartingale markets.
We prove that a topological contact isotopy uniquely defines a topological contact Hamiltonian. Combined with previous results from [MS11], this generalizes the classical one-to-one correspondence between smooth contact isotopies and their generating smooth contact Hamiltonians and conformal factors to the group of top…
Smooth algebra analysis for one-dimensional singular foliations.
problem Analyzing smooth algebras of one-dimensional singular foliations.
method Analyzing natural ideals and using Dixmier-Malliavin theorem.
result Smooth algebras of one-dimensional singular foliations are pairwise nonisomorphic.
This article is about a natural distance function induced by smooth cobordisms between links. We show that the cobordism distance of torus links is determined by the profiles of their signature functions, up to a constant factor.
Isoperimetric regions in scaled product manifolds are products of regions in each factor.
problem Characterizing isoperimetric regions in anisotropically scaled product manifolds.
method Analyzing regions with smooth boundaries in scaled product manifolds.
result Isoperimetric regions in scaled product manifolds are products of regions in each factor.
The Schatten- norm () has been widely used to replace the nuclear norm for better approximating the rank function. However, existing methods are either 1) not scalable for large scale problems due to relying on singular value decomposition (SVD) in every iteration, or 2) specific to some values, e.g., $1/…
Study cyclic group actions on specific high-dimensional manifolds.
problem Classify smooth actions of cyclic groups on certain high-dimensional manifolds.
method Analyzes smooth orientation-preserving actions of on -connected -manifolds.
result Classifications up to smooth conjugation for specific cases of and .
Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), NonnegativeMatrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (Smo…
In this paper we develop a Morse-like theory in order to decompose birational maps and morphisms of smooth projective varieties defined over a field of characteristic zero into more elementary steps which are locally étale isomorphic to equivariant flips, blow-ups and blow-downs of toric varieties. A crucial role in th…
Gradient descent solves asymmetric low-rank matrix factorization efficiently.
problem Optimizing asymmetric low-rank matrix factorization with non-convex and non-smoothness issues.
method Randomly initialized gradient descent with new symmetrization and perturbation techniques.
result Gradient descent converges to a global minimum of the asymmetric low-rank factorization problem.
We develop a new theoretical framework, the \emph{envelope complexity}, to analyze the minimax regret with logarithmic loss functions and derive a Bayesian predictor that adaptively achieves the minimax regret over high-dimensional -balls within a factor of two. The prior is newly derived for achieving the mini…
We recall the notions of Frölicher and diffeological spaces and we build regular Frölicher Lie groups and Lie algebras of formal pseudo-differential operators in one independent variable. Combining these constructions with a smooth version of the Mulase factorization of infinite dimensional groups based on formal pseud…
We consider derivative-free algorithms for stochastic and non-stochastic convex optimization problems that use only function values rather than gradients. Focusing on non-asymptotic bounds on convergence rates, we show that if pairs of function values are available, algorithms for -dimensional optimization that use …
EAP clusters evolving data, promoting temporal smoothness and automatic cluster tracking.
problem Clustering time-evolving data with temporal smoothness and automatic cluster identification.
method Evolutionary Affinity Propagation (EAP) on a factor graph exchanging messages between adjacent data snapshots.
result EAP clusters data with temporal smoothness and automatically tracks clusters, outperforming existing methods.
Improved guarantees for nonconvex matrix factorization with rank overparameterization.
problem Minimizing nonconvex objective over low-rank matrices.
method Overparameterized Burer--Monteiro approach, leveraging smoothness and strong convexity.
result Local optimization globally converges to global optimum under certain rank conditions.