Independent component analysis (ICA) decomposes multivariate data into mutually independent components (ICs). The ICA model is subject to a constraint that at most one of these components is Gaussian, which is required for model identifiability. Linear non-Gaussian component analysis (LNGCA) generalizes the ICA model t…
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,657 papers · 148 categories
Trend · papers per month
48 results for “components”
Colored Unlinkingmath.GT
In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of crossing changes needed to unlink without changing the crossings between components. …
New phenomenon found in Gothen components' boundary.
problem Character variety boundaries.
method Length spectrum compactification analysis.
result Hitchin component and Gothen components share boundary.
Innovates a three-component link homotopy invariant.
problem Classifying three-component link maps up to homotopy.
method Developed tools and invariants for distinguishing three-component link maps.
result Found three-component link maps that are not homotopic.
This note proves properties of surface-links with trivial components.
problem Properties of surface-links with trivial components.
method Analyzes closed oriented disconnected surfaces and their links.
result For certain surface-links, trivial components result in ribbon links.
A fast method estimates Gaussian mixture components without iterative fitting.
problem Estimating the number of components in high-dimensional Gaussian mixtures.
method Center data, compute singular values, and count above a threshold.
result The estimator consistently recovers the true number of components under mild separation condition.
In this paper the exact linear relation between the leading eigenvectors of the modularity matrix and the singular vectors of an uncentered data matrix is developed. Based on this analysis the concept of a modularity component is defined, and its properties are developed. It is shown that modularity component analysis …
The paper shows infinitely many components in Floer Hessians space.
problem Understanding the structure of Floer Hessians.
method Proving the existence of infinitely many connected components.
result Proves infinitely many connected components in Floer Hessians space.
New concept of quasi-ribbon surface-links simplifies complex surface-links.
problem Complexity in surface-links of trivial components.
method Introducing quasi-ribbon surface-links as a generalization of ribbon surface-links.
result Every F-link of trivial components on a surface F with at most one aspheric component is a quasi-ribbon surface-link.
New simulations advise caution in choosing principal components for multivariate functional data.
problem Inaccurate selection of principal components in multivariate functional data.
method Extensive simulations investigating the reliability of percentage of variance explained thresholds.
result Conventional threshold methods may fail to accurately explain overall variance in multivariate functional data.
Research has shown that widely used deep neural networks are vulnerable to carefully crafted adversarial perturbations. Moreover, these adversarial perturbations often transfer across models. We hypothesize that adversarial weakness is composed of three sources of bias: architecture, dataset, and random initialization.…
We construct links of arbitrarily many components each component of which is slice and yet are not concordant to any link with even one unknotted component. The only tool we use comes from the Alexander modules.
Uniform bounds found for Sierpinski carpet hyperbolic components.
problem Bounding hyperbolic components of Sierpinski carpet type.
method Establishing uniform a priori bounds and analyzing quadratic-like restrictions.
result Sierpinski carpet hyperbolic components of disjoint type are bounded.
The object of this paper is to study GL(2,R) orbit closures in hyperelliptic components of strata of abelian differentials. The main result is that all higher rank affine invariant submanifolds in hyperelliptic components are branched covering constructions, i.e. every translation surface in the affine invariant subman…
We develop a mean-field theory for multi-component ICA in high dimensions.
problem Understanding multi-component ICA in high-dimensional settings.
method Asymptotically exact mean-field theory for multi-component online ICA.
result Explicit learnability boundaries and competition conditions linking step size, data moments, and initialization.
Research examines the distribution of curve components in random multicurves.
problem Distribution of curve components in random multicurves.
method Action of the mapping class group on random multicurves.
result Distribution of curve components analyzed.
FMM fails to accurately determine the number of components even with consistent posterior.
problem Determining the number of subpopulations in a data set using FMM.
method Analysis of FMM component-count posterior under model misspecification.
result FMM component-count posterior diverges under model misspecification, contrary to intuition.
msPCA solves sparse PCA for multiple components efficiently.
problem Sparse principal component analysis with multiple components.
method Alternating maximization algorithm for sparse loading vectors, with orthogonality or zero correlation constraints.
result Achieves high variance explained with sparse components and controlled feasibility violations.
Principal component regression (PCR) is a two-stage procedure that selects some principal components and then constructs a regression model regarding them as new explanatory variables. Note that the principal components are obtained from only explanatory variables and not considered with the response variable. To addre…
Bayesian approach learns nonparametric mixture components from heterogeneous data.
problem Realistic modeling of heterogeneous data populations with nonparametric mixture components.
method Bayesian nonparametric modeling using Dirichlet process mixture priors.
result Posterior contraction rates for component densities are nearly polynomial, improving over deconvolution methods.
System learns to combine multiple model components for personalized text generation.
problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.
Found a new connected component in symplectic structures.
problem Understanding symplectic structures in higher dimensions.
method Provided an example in dimension four.
result First example of a nontrivial connected component.
The paper proposes reusable network components by making them compatible across tasks.
problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.
New invariants lift Milnor invariants for 3-component links.
problem Classifying 3-component links using Milnor invariants.
method Defined and proved invariants , introduced , and showed their equivalence.
result Invariants lift certain Milnor invariants and are invariant under weak cobordism.
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nont…
The paper introduces COAR to estimate component attributions and enable model editing.
problem Understanding how ML models transform inputs into predictions.
method Component modeling and COAR algorithm for estimating component attributions.
result COAR enables model editing across various tasks.
Study topological components of surface group representations into SL(2,R) and PSL(2,R).
problem Understanding the structure of representation spaces of surface groups.
method Utilized the signature formula to determine connected components of representation spaces.
result Determined the number of connected components for different types of holonomies.
Identifying components and estimating mixing weights in unlabeled finite mixtures under marginal independence.
problem Identifying components and estimating mixing weights in unlabeled finite mixtures.
method Proving structural results and extending them to observable mixtures.
result Identifying components and estimating mixing weights under marginal independence.
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to neighborhood homotopy by the elementary divisor of a linking matrix with respect to th…
We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effecti…
Essential principal components simplify spectral analysis with minimal training data.
problem Accurate spectral quantification from complex mixtures.
method Identifying essential principal components and using molar extinction coefficients.
result Near one-to-one projection from principal components to mixture constituents.
Survey on Higgs bundle moduli spaces and their connected components.
problem Counting connected components of Higgs bundle moduli spaces.
method Analyzes moduli spaces for Higgs bundles associated with real Lie groups and closed Riemann surfaces.
result Explicit descriptions of some moduli space components are possible.
Derives Fredholm criteria for isotypical components from a Simonenko principle.
problem Finding Fredholm conditions for isotypical components of invariant pseudodifferential operators.
method General Simonenko's local principle and equivariant local principle for restriction to isotypical components.
result Full proof of equivariant local principle and extension of results.
In this paper, we study connected components of strata of the space of quadratic differentials lying over $\T_g$. We use certain general properties of sections of line bundles to put a upper bound on the number of connected components, and a generalized version of the Gauss map as an invariant to put a lower bound on t…
Connected components of generalized strata of meromorphic differentials with residue conditionsmath.AG
Classifies connected components of meromorphic differentials with residue conditions.
problem Understanding the structure of meromorphic differentials with residue constraints.
method Analyzes the multi-scale compactification and residue conditions.
result Classified connected components of generalized strata of meromorphic differentials.
PCHAL and PCHAR use principal components to speed up HAL and HAR methods.
problem Computational infeasibility in high dimensions for HAL and HAR.
method Outcome-blind principal component reduction of HAL basis.
result Empirical performance comparable to HAL and HAR, with computational gains.
Identifies Anosov representations of hyperbolic triangle groups in SL(3,R).
problem Classifying Anosov representations of hyperbolic triangle groups into SL(3,R).
method Proving representations are Anosov if they lie in the Hitchin component or the Barbot component, with specific conditions for eigenvalues.
result Anosov representations in SL(3,R) have non-convex boundary maps.
Efficient private matrix analysis algorithms for recent variants.
problem Private analysis of recent matrix updates.
method Identifying sufficient conditions on positive semidefinite matrices.
result First efficient differentially private algorithms for various matrix analysis tasks.
QAPCA uses quantum annealing for robust PCA.
problem Outliers in data skew L2-norm principal components.
method Quantum annealing for L1-norm optimization.
result QAPCA's reconstruction error is comparable to L1-BF.
Clustering of data sets is a standard problem in many areas of science and engineering. The method of spectral clustering is based on embedding the data set using a kernel function, and using the top eigenvectors of the normalized Laplacian to recover the connected components. We study the performance of spectral clust…
Characterizes components of representations space for punctured surfaces.
problem Characterizing connected components of representations space.
method Using relative Euler classes, signs of peripheral elements, and generalized Milnor-Wood inequality.
result Counted total number of connected components of type-preserving representations.
Uniform foliations with Reeb components on 3-manifolds.
problem Characterizing uniform foliations with Reeb components.
method Study of foliations on 3-manifolds with infinite fundamental group.
result Examples and results on behavior of foliations.
We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal …
Explicit computation of symplectic form for -Hitchin component.
problem Symplectic structure of -Hitchin component.
method Atiyah-Bott-Goldman symplectic form and global coordinates.
result Coefficients of the symplectic form are constant.
In this paper, we analyze L-space surgeries on two component L-space links. We show that if one surgery coefficient is negative for the L-space surgery, then the corresponding link component is an unknot. If the link admits very negative (i.e. ) L-space surgeries, it is the Hopf link. We also give a w…
Computes the component group of real reductive groups.
problem Computing the component group of real reductive groups.
method Using structure results for real loci of algebraic groups and Galois cohomology.
result Explicit elements representing all connected components of .
Autoencoder-Based Parameter Estimation for Superposed Multi-Component Damped Sinusoidal Signalscs.LG
Autoencoder estimates parameters of noisy, multi-component damped signals.
problem Parameter estimation of damped sinusoidal signals under rapid decay and noise.
method Autoencoder-based approach using latent space for frequency, phase, decay, and amplitude estimation.
result High accuracy in parameter estimation, robustness to subdominant components and phase differences.
New supervised and unsupervised NFLTs for elliptical distributions.
problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.