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…
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.
Trend · papers per month
Deep weight factorization improves neural network training through smooth optimization of sparse penalties.
GLSKF improves tensor completion by capturing both global and local variations.
Study shows how Poisson brackets factor on infinite dimensional manifolds.
We introduce a general tensor model suitable for data analytic tasks for {\em heterogeneous} datasets, wherein there are joint low-rank structures within groups of observations, but also discriminative structures across different groups. To capture such complex structures, a double core tensor (DCOT) factorization mode…
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.
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.
TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.
New RBF networks can approximate any continuous function.
SATL adapts to varying smoothness in hypothesis transfer learning.
New algorithms SVCA and SSPA improve robustness to noise in nonnegative matrix factorization.
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…
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…
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…
We generalize a classical result concerning smooth germs of surfaces, by proving that monodromies on links of isolated complex surface singularities associated with reduced holomorphic map germs admit a positive factorization. As a consequence of this and a topological characterization of these monodromies by Anne Pich…
Randomized smoothing, using just a simple isotropic Gaussian distribution, has been shown to produce good robustness guarantees against -norm bounded adversaries. In this work, we show that extending the smoothing technique to defend against other attack models can be challenging, especially in the high-dimensi…
Deep ReLU networks can approximate and learn smooth functions efficiently.
New methods optimize functions on hyperbolic and spherical spaces, matching Euclidean rates 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.
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…
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…
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…
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…
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…
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.…
Paper develops a discounted algorithm for online convex optimization that adapts to unknown discount factors.
High-dimensional models trained on smooth manifolds achieve optimal rates in Wasserstein metrics.
Study forward investment performance in semimartingale markets with stochastic factors.
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.
In this paper we study smooth orientation-preserving free actions of the cyclic group on a class of -connected -manifolds, , where is a homotopy -sphere. When we obtain a classification up to topological conjugation. When we obtain a classi…
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.
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/…
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.
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…
A dynamical analog of the prime ideals for simple non-commutative rings is introduced. We prove a factorization theorem for the dynamical ideals. The result is used to classify the surface knots and links in the smooth 4-dimensional manifolds.
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 …
Improved guarantees for nonconvex matrix factorization with rank overparameterization.