arXiv research

Division algorithm for surface group rings yields standard complexes and cohomological dimensions.

Paper calculates L-invariant and L*-invariant for complex surface sums.

We analyze geometrical structures necessary to represent bulk and surface interactions of standard and substructural nature in complex bodies. Our attention is mainly focused on the influence of diffuse interfaces on sharp discontinuity surfaces. In analyzing this phenomenon, we prove the covariance of surface balances…

The paper classifies and constructs 6D GKM manifolds with 4 fixed points.

Proposes Neural Complexity (NC) for predicting and explaining generalization in deep neural networks.

The linear slice of quasi-Fuchsian once-punctured torus groups is defined by fixing the complex length of some simple closed curve to be a fixed positive real number. It is known that the linear slice is a union of disks, and it always has one standard component containing Fuchsian groups. Komori and Yamashita proved t…

This paper improves learning complex functions with CoT supervision, reducing sample complexity.

Paper proves a quantitative estimate for transforming almost complex structures into standard ones.

DR-MCTS improves decision quality and sample efficiency in complex environments.

Paper extends learning theory to dependent data with uniform risk bounds.

The paper extends Newlander-Nirenberg theorem to domains with $C^2$ boundary.

We study the compactness of sequences of diffeomorphisms in almost complex manifolds in terms of the direct images of the standard integrable structure.

Transductive learning considers situations when a learner observes $m$ labelled training points and $u$ unlabelled test points with the final goal of giving correct answers for the test points. This paper introduces a new complexity measure for transductive learning called Permutational Rademacher Complexity (PRC) and …

The standard interpretation of importance-weighted autoencoders is that they maximize a tighter lower bound on the marginal likelihood than the standard evidence lower bound. We give an alternate interpretation of this procedure: that it optimizes the standard variational lower bound, but using a more complex distribut…

This paper improves bounds on DNN generalization to adversarial examples.

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings …

The paper calculates the number of closed cycles in a specific complex group.

The paper explores conditions for the existence of orthogonal almost complex structures on manifolds.

We prove the existence of stationary discs in the ball for small almost complex deformations of the standard structure. We define a local analogue of the Riemann map and establish its main properties. These constructions are applied to study the local geometry of almost complex manifolds and their morphisms.

Study reveals adversarially robust domain adaptation is harder to generalize across domains.

We review the standard Hopf construction of Reeb components with leafwise complex structure and almost determine the group of leafwise holomorphic smooth automorphisms for Reeb components of certain type in the case of complex leaf dimension one. In particular, it contains an infinite dimensional vector space.

Linear principal component analysis (PCA) can be extended to a nonlinear PCA by using artificial neural networks. But the benefit of curved components requires a careful control of the model complexity. Moreover, standard techniques for model selection, including cross-validation and more generally the use of an indepe…

We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, this approach provides an adaptable step-size LMS algorithm together with a measure of uncertainty about the estimation. In addition, the proposed approximation preserves the linear complexity of the standard LMS. Numerical…

We show that the almost complex structure underlying a non-Kahler, nearly Kahler 6-manifold (in particular, the standard almost complex structure of S^6) cannot be compatible with any symplectic form, even locally.

Two Kähler structures are PCR equivalent in the Siegel domain.

Characterizes the sample complexity of list regression tasks.

In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, …

The role of $L^2$ regularization, in the specific case of deep neural networks rather than more traditional machine learning models, is still not fully elucidated. We hypothesize that this complex interplay is due to the combination of overparameterization and high dimensional phenomena that take place during training …

Characterizes conformal classes of tori using differential geometry.

Improves NF for complex data distributions with multiple modes.

In this paper, we prove that principal circle bundles over the complex projective space equipped with the standard Sasakian structures are volume rigid among all $K$-contact manifolds satisfying positivity conditions of tensors involing the Tanaka-Webster curvature.

Linformer reduces transformer complexity to linear, improving efficiency.

Decouples moduli groups in heterotic string theory cohomology.

In this paper we construct complex contact structures on $\mathbb{C}^{2n+1}$ for any $n\ge 1$ with the property that every holomorphic Legendrian map $\mathbb{C}\to \mathbb{C}^{2n+1}$ is constant. In particular, these contact structures are not globally contactomorphic to the standard complex contact structure on $\mat…

We show that the genus problem for alternating knots with $n$ crossings has linear time complexity and is in Logspace$(n)$. Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We show that the genus problem for these knots belongs to $TC^0$ circuit complexity c…

We compute first variation formulas for the complex components of the Bakry-Emery-Ricci endomorphism along Kähler structures. Our formulas show that the principal parts of the variations are quite standard complex differential operators with particular symmetry properties on the complex decomposition of the variation o…

In \cite{BSV}, Borisov, Salamon and Viaclovsky constructed non-standard orthogonal complex structures on flat tori $T^{2n}_{\mathbb R}$ for any $n\geq 3$. We will call these examples BSV-tori. In this note, we show that on a flat $6$-torus, all the orthogonal complex structures are either the complex tori or the BSV-to…

In terms of Turaev's shadows, we provide a sufficient condition for a compact, smooth, acyclic 4-manifold with boundary the 3-sphere to be diffeomorphic to the standard 4-ball. As a consequence, we prove that if a compact, smooth, acyclic 4-manifold with boundary the 3-sphere has shadow-complexity at most 2, then it is…

Study shows symplectic hypersurfaces transform complex projective spaces.

Proves planar graphs' configuration spaces have highest topological complexity.

Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the number of independent parameters. When hidden variables are present, however, standard dimension might no longer be ap…

We present arguments for the formulation of unified approach to different standard continuous inference methods from partial information. It is claimed that an explicit partition of information into a priori (prior knowledge) and a posteriori information (data) is an important way of standardizing inference approaches …

We prove that any compact almost complex manifold $(M, J)$ of real dimension $2m$ admits a pseudo-holomorphic embedding in a Euclidean space of dimension $4m + 2$, endowed with a suitable non-standard almost complex structure. Moreover, we give a necessary and sufficient condition, expressed in terms of the Segre class…

We introduce the concept of a standard form for two embedded maximal sphere systems in the doubled handlebody, and we prove an existence and uniqueness result. In particular, we show that pairs of maximal sphere systems in the doubled handlebody (up to homeomorphism) bijectively correspond to square complexes satisfyin…

We use the CR geometry of the standard hyperquadric in complex projective three-space to give a detailed twistor description of conformal foliations in Euclidean three-space.

The standard LSTM recurrent neural networks while very powerful in long-range dependency sequence applications have highly complex structure and relatively large (adaptive) parameters. In this work, we present empirical comparison between the standard LSTM recurrent neural network architecture and three new parameter-r…

We explicitly write down all eigenvalues of the Rumin Laplacian on the standard contact spheres, and express the analytic torsion functions associated with the {Rumin complex} in terms of the Riemann zeta function. In particular, we find that the functions vanish at the origin and determine the analytic torsions.

We study the temporal evolution of the market efficiency in the stock markets using the complexity, entropy density, standard deviation, autocorrelation function, and probability distribution of the log return for Standard and Poor's 500 (S&P 500), Nikkei stock average index, and Korean composition stock price index (K…