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

Trend · papers per month

104209313417 · Jun 202019922001200920172026
48 results for multiple components

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.

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.

Paper proposes a robust framework for detecting multiple periodic components in time series.

problem Detecting multiple periodic components in time series with interlaced patterns and external noise.
method Applying maximal overlap discrete wavelet transform to isolate periodic components, ranking them by wavelet variance, and detecting single periodicity robustly.
result The proposed algorithm outperforms other methods for both single and multiple periodicity detection.

Independent Component Analysis (ICA) - one of the basic tools in data analysis - aims to find a coordinate system in which the components of the data are independent. In this paper we present Multiple-weighted Independent Component Analysis (MWeICA) algorithm, a new ICA method which is based on approximate diagonalizat…

2019-05-31abs ↗pdf ↗

The paper studies multiple descent in multi-component prediction models.

problem Understanding the risk curves in multi-component prediction models.
method Investigates a 'double random feature model' and 'multiple random feature model' in ridge regression.
result Risk curves of multi-component prediction models can exhibit multiple descents.

We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and def…

2015-08-04abs ↗pdf ↗

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

Correlated component analysis as proposed by Dmochowski et al. (2012) is a tool for investigating brain process similarity in the responses to multiple views of a given stimulus. Correlated components are identified under the assumption that the involved spatial networks are identical. Here we propose a hierarchical pr…

2018-02-07abs ↗pdf ↗

Constructs initial data for multiple black holes with specified ADM parameters.

problem Forming multiple black holes with specific ADM parameters.
method Smooth, asymptotically flat vacuum initial data with prescribed ADM energy, momentum, and angular momentum.
result Maximal development of data results in spacetimes containing multiple black holes.

Paper extends RPD for better handling multiple modalities and non-convexity.

problem Handling multiple modalities and non-convexity in data clouds.
method Computes RPD in a reproducing kernel Hilbert space using kernel principal component analysis.
result The method outperforms RPD and is comparable to other models on benchmark datasets.

We show that strictly stable components of Allen-Cahn minimal hypersurfaces always occur with multiplicity one. We also establish the uniqueness of solutions converging to nondegenerate hypersurfaces with multiplicity one. Our results work in all dimensions and without variational assumptions on the Allen-Cahn solution…

2019-12-19abs ↗pdf ↗

Let MM be a fibered 3-manifold with multiple boundary components. We show that the fiber structure of MM transforms to closely related transversely oriented taut foliations realizing all rational multislopes in some open neighborhood of the multislope of the fiber. Each such foliation extends to a taut foliation in t…

2012-11-15abs ↗pdf ↗

New method estimates effects of multiple nutrients on blood glucose.

problem Estimating physiological response to multiple nutrient treatments.
method Convolution-based multi-output Gaussian process model.
result Improved prediction accuracy and better interpretation of individual nutrient effects.

Given a handle decomposition of a 4-manifold with boundary, and an open book decomposition of the boundary, we show how to produce a trisection diagram of a trisection of the 4-manifold inducing the given open book. We do this by making the original proof of the existence of relative trisections more explicit, in terms…

2018-01-26abs ↗pdf ↗

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…

2007-05-15abs ↗pdf ↗

Mixture components improve VAE performance by increasing latent flexibility.

problem Improving variational autoencoder (VAE) performance through more flexible latent representations.
method Modeling mixture components with separate encoder networks and analyzing their impact on ELBO.
result Increasing the number of mixture components improves VAE performance on various datasets.

ST-MTM models complex time series by decomposing and masking seasonal and trend components.

problem Forecasting complex time series with intricate temporal variations.
method Seasonal-Trend Decomposition with Masking and Contrastive Learning.
result ST-MTM achieves superior forecasting performance compared to existing methods.

This paper derives a portfolio decomposition formula when the agent maximizes utility of her wealth at some finite planning horizon. The financial market is complete and consists of multiple risky assets (stocks) plus a risk free asset. The stocks are modelled as exponential Brownian motions with drift and volatility b…

2007-02-24abs ↗pdf ↗

The paper explores the identifiability and interpretability of Gaussian process models using different kernel structures.

problem Identifiability and interpretability issues in Gaussian process models.
method The paper examines both single-output and multi-output Gaussian process models using additive and multiplicative mixtures of Matérn kernels.
result The smoothness of a mixture of Matérn kernels is determined by the least smooth component, and none of the mixing weights or parameters are identifiable.

In the multiple linear regression setting, we propose a general framework, termed weighted orthogonal components regression (WOCR), which encompasses many known methods as special cases, including ridge regression and principal components regression. WOCR makes use of the monotonicity inherent in orthogonal components …

2017-09-13abs ↗pdf ↗

We prove two explicit bounds for the multiplicities of Steklov eigenvalues σkσ_k on compact surfaces with boundary. One of the bounds depends only on the genus of a surface and the index kk of an eigenvalue, while the other depends as well on the number of boundary components. We also show that on any given smooth Rie…

2012-09-21abs ↗pdf ↗

We give a formula of the connected component decomposition of the Alexander quandle: Z[t±1]/(f1(t),,fk(t))=i=0a1Orb(i)\mathbb{Z}[t^{\pm1}]/(f_1(t),\ldots, f_k(t))=\bigsqcup^{a-1}_{i=0}\mathrm{Orb}(i), where a=gcd(f1(1),,fk(1))a=\gcd (f_1(1),\ldots, f_k(1)). We show that the connected component Orb(i)\mathrm{Orb}(i) is isomorphic to Z[t±1]/J\mathbb{Z}[t^{\pm1}]/J with an expli…

2017-04-25abs ↗pdf ↗

A Gauss paragraph is a combinatorial formulation of a generic closed curve with multiple components on some surface. A virtual string is a collection of circles with arrows that represent the crossings of such a curve. Every closed curve has an underlying virtual string and every virtual string has an underlying Gauss …

2004-12-01abs ↗pdf ↗

A hybrid loss framework improves time series forecasting by balancing global and component errors.

problem Current time series methods may prioritize less significant sub-series, leading to forecasting bias.
method Proposes a hybrid loss framework combining global and component losses, dynamically adjusting weights.
result Improves time series forecasting performance by 0.5-2% on average.

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.

A new method clusters data from multiple sources using a mixture of multilayer SBMs.

problem Aggregating multiple clustering results from different data sources.
method Uses a mixture of multilayer Stochastic Block Models (SBM) to group co-membership matrices.
result Identifies and clusters observations based on their specificities within components.

Improves understanding of PWS by calculating influence of sources and data.

problem Understanding the influence of each component in PWS.
method Proposes source-aware Influence Function (IF) to decompose and calculate influence.
result Improves end model's generalization performance and identifies mislabeling.

The paper extends intensity models for limit order books using marked point processes.

problem Modeling intensity ratios in limit order books with state dependency and clustering.
method Developed a new model combining three multiplicative components for marked point processes.
result The new model outperforms other intensity-based methods in predicting market order signs and aggressiveness.