Research
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,695 papers · 148 categories

Trend · papers per month

3978116155 · Jun 202019922001200920172026
48 results for CN matrix

The study constructs minimal submanifolds in complex and quaternionic projective spaces.

problem Finding minimal submanifolds in complex and quaternionic projective spaces.
method Using complex-valued harmonic morphisms.
result Complete minimal submanifolds of odd-dimensional complex projective spaces and their dual hyperbolic spaces are constructed.

Capsule Networks (CN) offer new architectures for Deep Learning (DL) community. Though its effectiveness has been demonstrated in MNIST and smallNORB datasets, the networks still face challenges in other datasets for images with distinct contexts. In this research, we improve the design of CN (Vector version) namely we…

2019-03-18abs ↗pdf ↗

We give a necessary complex geometric condition for a bounded smooth convex domain in Cn, endowed with the Kobayashi distance, to be Gromov hyperbolic. More precisely, we prove that if a smooth bounded convex domain contains an analytic disk in its boundary, then the domain is not Gromov hyperbolic for the Kobayashi di…

2013-12-02abs ↗pdf ↗

Protein interaction networks are a promising type of data for studying complex biological systems. However, despite the rich information embedded in these networks, they face important data quality challenges of noise and incompleteness that adversely affect the results obtained from their analysis. Here, we explore th…

2012-10-25abs ↗pdf ↗

The paper analyzes the robustness of a minimum 2\ell_2 interpolator in high-dimensional linear regression.

problem Analyzing the robustness of a minimum 2\ell_2 interpolator in high-dimensional linear regression.
method The paper analyzes the interpolator with minimal 2\ell_2-norm in a general high-dimensional linear regression framework, proving bounds on prediction loss.
result The paper shows that the prediction loss of the interpolator is bounded by (β22rcn(Σ)ξ2)/n(\|β^*\|^2_2r_{cn}(Σ)\vee \|ξ\|^2)/n with high probability, revealing a transition in rates.

New model for Witten-Reshetikhin-Turaev invariants using Lagrangian intersections.

problem Categorification of Witten-Reshetikhin-Turaev invariants for 3-manifolds.
method Constructing a topological model from quantum group U_q(sl(2)) using Lagrangian intersections in configuration spaces.
result Witten-Reshetikhin-Turaev invariants are encoded by intersections of Lagrangian submanifolds in a fixed configuration space.

Study Lie algebras with complex structures, focusing on degenerations and deformations.

problem Understanding the space of Lie algebras with complex structures and their transformations.
method Identifying invariants that remain consistent under degenerations and applying to four-dimensional case.
result Found invariants that help in understanding the behavior of Lie algebras under complex structures.

A new method for estimating uncertainty intervals in regression.

problem Lack of effective methods to estimate uncertainty intervals in regression.
method Collaborating Networks (CN) approach using two neural networks with distinct loss functions.
result CN method improves performance on various real-world datasets, including forecasting A1c values in diabetic patients.

For a semisimple Lie group GG with parabolic subgroups QPGQ\subset P\subset G, we associate to a parabolic geometry of type (G,P)(G,P) on a smooth manifold NN the correspondence space $\Cal CN$, which is the total space of a fiber bundle over NN with fiber a generalized flag manifold, and construct a canonical parabolic…

2001-02-13abs ↗pdf ↗

Smile-GANs clusters brain MRI scans to reveal disease subtypes and progression.

problem Understanding disease heterogeneity in brain MRI scans.
method Generative Adversarial Networks (GANs) for semi-supervised clustering.
result Discovered four subtypes of Alzheimer's and prodromal phases, with two progressive pathways.

EPGP surrogate outperforms finite elements in solving wave equations.

problem Benchmarking Gaussian Process surrogates vs. finite elements for wave equation solutions.
method EPGP uses penalized least squares and exponential-polynomial bases; CN-FEM employs Crank--Nicolson time stepping.
result EPGP achieves lower error than CN-FEM under matched degrees-of-freedom.

Deep learning has demonstrated abilities to learn complex structures, but they can be restricted by available data. Recently, Consensus Networks (CNs) were proposed to alleviate data sparsity by utilizing features from multiple modalities, but they too have been limited by the size of labeled data. In this paper, we ex…

2018-05-23abs ↗pdf ↗

1. Translated by Thomas E. Cecil, Department of Mathematics and Computer Science, College of the Holy Cross, Worcester, MA 01610, USA; E-mail address: cecil@mathcs.holycross.edu 2. Typed by Wenjiao Yan, School of Mathematical Sciences, Laboratory of Mathematics and Complex Systems, Beijing Normal University, Beijing 10…

2011-12-13abs ↗pdf ↗

Proves Hölder continuity of complex Monge-Ampère solutions.

problem Global Hölder continuity of solutions to complex Monge-Ampère equation.
method Analyzes Dirichlet problem on strictly pseudoconvex domains or Hermitian manifolds.
result Proves global Hölder continuity of solutions under given conditions.

Proposes a VAE for HDLSS data augmentation.

problem Data augmentation in HDLSS settings with small sample sizes.
method Geometry-based variational autoencoder with latent space modeling.
result Significant improvement in classification metrics (e.g., balanced accuracy from 66.3% to 74.3%).

In this paper we prove a new matrix Li-Yau-Hamilton estimate for Kähler-Ricci flow. The form of this new Li-Yau-Hamilton estimate is obtained by the interpolation consideration originated in \cite{Ch1}. This new inequality is shown to be connected with Perelman's entropy formula through a family of differential equalit…

2005-02-23abs ↗pdf ↗

New algorithm for computing Gaussian mixtures with guaranteed accuracy and efficiency.

problem Computing the nonparametric maximum likelihood estimator for Gaussian mixtures efficiently and accurately.
method Developed an algorithm that computes an ε-approximation of the estimator in Wasserstein distance with time complexity K+Cnk2loglog(1/ε)K+Cnk^2\log\log(1/\varepsilon), and certifiably computes the exact number of components.
result The algorithm provides guaranteed accuracy and efficiency for computing the nonparametric maximum likelihood estimator for Gaussian mixtures.

Random covers of hyperbolic surfaces have a spectral gap with polynomial rate.

problem Finding spectral gaps in random covers of hyperbolic surfaces.
method Applying recent work on spectral gaps to uniformly random covers of closed hyperbolic surfaces.
result Uniformly random degree-n covers of a closed hyperbolic surface have no new Laplacian eigenvalues below a specific threshold with high probability.

The paper tackles causal bandits with unknown SCMs and soft interventions, providing upper and lower bounds on regret.

problem Optimizing interventions in a causal system with unknown SCMs and soft interventions.
method Assumes unknown SCMs from a general class, allows infinite interventions, and provides upper and lower bounds on regret.
result General upper and lower bounds on cumulative achievable regret for various SCMs.

Ensemble model predicts AD progression from CN status with high accuracy.

problem Early prediction of clinical progression from cognitively normal to mild cognitive impairment or Alzheimer's disease.
method Ensemble survival analysis combining penalized Cox regression, advanced survival models, and aggregation techniques.
result Ensemble model achieved peak C-index of 0.907 and integrated time-dependent AUC of 0.904, outperforming baseline models.

We describe some buildings related to complex Kac-Moody groups. First we describe the spherical building of SLn(C) (i.e. the projective geometry PG(Cn)) and its Veronese representation. Next we recall the construction of the affine building associated to a discrete valuation on the rational function field C(z)C(z). Then …

2001-09-19abs ↗pdf ↗

Unified proof of smooth fibration theorems for collapsed manifolds.

problem Smooth fibration theorems for collapsed manifolds with Ricci curvature bounded below.
method Generalized Reifenberg condition and transformation technique for almost splitting maps.
result Unified proof of smooth fibration theorems in many previous works.

In this paper we complete the study of the normal holonomy groups of complex submanifolds (non nec. complete) of Cn or CPn. We show that irreducible but non transitive normal holonomies are exactly the Hermitian s-representations of [CD09, Table 1] (see Corollary 1.1). For each one of them we construct a non necessaril…

2015-03-06abs ↗pdf ↗

A new clustering method uses nonparametric smoothing to estimate cluster membership functions.

problem Clustering with flexible, nonparametric estimation.
method Nonparametric smoothing to estimate cluster membership functions without explicit modelling assumptions.
result The method automatically determines the number of clusters and level of flexibility.

The paper defines cross-section continuity for angular momentum definitions and finds the CWY definition valid.

problem Defining angular momentum at null infinity and ensuring its continuity across different cross-sections.
method Introducing cross-section continuity as a criterion and proving it for specific angular momentum definitions.
result The Chen-Wang-Yau definition of angular momentum satisfies cross-section continuity, while the Compere-Nichols modification does not.

A rack of order nn is a binary operation $\rack$ on a set XX of cardinality nn, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all yXy\in X, and $(x\rack y)\rack z=(x\rack z)\rack (y\rack z)$ for all x,y,zXx,y,z\in X. …

2012-03-29abs ↗pdf ↗

It is now well known that deep neural networks (DNNs) are vulnerable to adversarial attack. Adversarial samples are similar to the clean ones, but are able to cheat the attacked DNN to produce incorrect predictions in high confidence. But most of the existing adversarial attacks have high success rate only when the inf…

2019-12-16abs ↗pdf ↗

WeSinger improves singing voice synthesis with data augmentation and specialized modules.

problem Improving the accuracy and naturalness of synthesized singing voices.
method Developed a multi-singer Chinese neural singing voice synthesis system with deep bi-directional LSTM, Transformer, LPCNet, and data augmentation.
result WeSinger achieves state-of-the-art performance on the Opencpop corpus.