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

Trend · papers per month

2356 · May 202619922001200920172026
48 results for top-n whitening

Reservoir subspace injection improves online ICA by preserving injected features.

problem Discarding injected features in top-nn whitening can degrade performance.
method Formalized reservoir subspace injection (RSI) and developed diagnostics (IER, SSO, ρ_x) to identify and mitigate the failure mode.
result RSI controller preserves passthrough retention, improving performance by up to 2.2 dB.

Extends homotopical theory to locally compact groups, refining their compactness properties.

problem Developing homotopical invariants for locally compact groups.
method Extending classical theory of homotopical ΣΣ-sets to locally compact Hausdorff groups, defining ΣtopnΣ_{\mathrm{top}}^n sets of characters.
result Recovering and generalizing classical results on characters and compactness properties of groups.

New Convolutional Unit improves Batch Whitening performance.

problem Improving the efficiency and effectiveness of Batch Whitening.
method Proposes a new Convolutional Unit that aligns with Batch Whitening theory and empirically analyzes the original Convolutional Unit.
result Significantly improved performance on multiple image classification datasets.

Whitening, or sphering, is a common preprocessing step in statistical analysis to transform random variables to orthogonality. However, due to rotational freedom there are infinitely many possible whitening procedures. Consequently, there is a diverse range of sphering methods in use, for example based on principal com…

2015-12-02abs ↗pdf ↗

Corrected whitening restores orthogonality in high-dimensional spherical Gaussian mixtures.

problem In high-dimensional data, standard whitening fails to preserve orthogonality of mixture means.
method Derived exact limits for whitened means dot products using random matrix theory, constructed a corrected whitening matrix.
result Corrected whitening allows for improved estimation of spherical Gaussian mixtures in the large-dimensional regime.

The importance of accurate recommender systems has been widely recognized by academia and industry. However, the recommendation quality is still rather low. Recently, a linear sparse and low-rank representation of the user-item matrix has been applied to produce Top-N recommendations. This approach uses the nuclear nor…

2016-02-25abs ↗pdf ↗

Top-N recommender systems have been investigated widely both in industry and academia. However, the recommendation quality is far from satisfactory. In this paper, we propose a simple yet promising algorithm. We fill the user-item matrix based on a low-rank assumption and simultaneously keep the original information. T…

2016-01-19abs ↗pdf ↗

A new KD model for collaborative filtering improves top-N recommendation performance.

problem Challenges in applying KD to recommender models due to feedback sparsity and ambiguity.
method Proposes a new KD model (CD) for collaborative filtering, reformulating a loss function, using probabilistic rank-aware sampling, and developing training strategies.
result Outperforms state-of-the-art methods by 2.7-33.2% in hit rate (HR) and 2.7-29.1% in NDCG.

We present here a new model and algorithm which performs an efficient Natural gradient descent for Multilayer Perceptrons. Natural gradient descent was originally proposed from a point of view of information geometry, and it performs the steepest descent updates on manifolds in a Riemannian space. In particular, we ext…

2017-04-24abs ↗pdf ↗

Proposes group whitening to enhance deep learning models' performance.

problem Improving learning efficiency and representational capacity in deep learning models.
method Group Whitening (GW) combines whitening and group normalization to balance these aspects.
result Group Whitening consistently improves model performance across different architectures and benchmarks.

wBSL uses whitening transformations to speed up BSL for intractable likelihood models.

problem Computational demands of Bayesian synthetic likelihood with growing summary statistics.
method Whitening transformations to decorrelate summary statistics.
result Significant reduction in model simulations required for accurate inference.

CW-Gen models improve probabilistic time series forecasting by incorporating prior information.

problem Challenges in probabilistic forecasting of multivariate time series due to non-stationarity, inter-variable dependencies, and distribution shifts.
method CW-Gen framework that incorporates prior information through conditional whitening. JMCE learns conditional mean and covariance, improving sample quality.
result CW-Gen consistently enhances predictive performance, capturing non-stationary dynamics and inter-variable correlations more effectively than prior-free approaches.

Batch Normalization (BN) is capable of accelerating the training of deep models by centering and scaling activations within mini-batches. In this work, we propose Decorrelated Batch Normalization (DBN), which not just centers and scales activations but whitens them. We explore multiple whitening techniques, and find th…

2018-04-23abs ↗pdf ↗

A new SSL method using whitening of latent-space features.

problem Efficiency and effectiveness of self-supervised representation learning.
method Proposes a new loss function based on whitening of latent-space features, avoiding the need for negatives and asymmetric networks.
result Improves efficiency and effectiveness of SSL by avoiding the need for negatives and asymmetric networks.

Data whitening and second order optimization harm generalization by reducing access to dataset information.

problem Harmful effects of data whitening and second order optimization on generalization in machine learning.
method Analysis of fully connected models and experimental verification.
result Data whitening and second order optimization reduce or prevent generalization by limiting access to dataset information.

Unified framework for scale-invariant representation learning using MAPCA.

problem Learning invariant representations in data.
method Metric-Aware Principal Component Analysis (MAPCA) based on generalized eigenproblem.
result MAPCA provides a unified geometric language for various self-supervised learning objectives.

WS diffusion models handle anisotropic Gaussian noise better than conventional methods.

problem Handling anisotropic Gaussian noise in imaging inverse problems.
method Whitened Score (WS) diffusion models based on stochastic differential equations.
result WS DMs outperform conventional DMs on anisotropic Gaussian noise.

Non-Gaussian component analysis (NGCA) is an unsupervised linear dimension reduction method that extracts low-dimensional non-Gaussian "signals" from high-dimensional data contaminated with Gaussian noise. NGCA can be regarded as a generalization of projection pursuit (PP) and independent component analysis (ICA) to mu…

2016-03-03abs ↗pdf ↗

Batch Normalization (BN) is a common technique used to speed-up and stabilize training. On the other hand, the learnable parameters of BN are commonly used in conditional Generative Adversarial Networks (cGANs) for representing class-specific information using conditional Batch Normalization (cBN). In this paper we pro…

2018-06-01abs ↗pdf ↗

A new method for generating sets and graphs without requiring exchangeability.

problem Generating exchangeable distributions for sets and graphs is challenging.
method Top-n creation, a differentiable generation mechanism that selects relevant points from a latent vector.
result Top-n method outperforms i.i.d. generation in various tasks.

The purpose if this master's thesis is to study and develop a new algorithmic framework for Collaborative Filtering to produce recommendations in the top-N recommendation problem. Thus, we propose Lanczos Latent Factor Recommender (LLFR); a novel "big data friendly" collaborative filtering algorithm for top-N recommend…

2016-06-14abs ↗pdf ↗

Data poisoning attacks can manipulate recommender systems to recommend target items.

problem Attacks on recommender systems to influence top-N item recommendations.
method Formulated as an optimization problem, solved using influence function to select influential users.
result Effective data poisoning attacks that outperform existing methods.

CVAE detects weak complex signals in maritime radar, improving detection over classical methods.

problem Detecting weak complex-valued signals in non-Gaussian, range-varying interference.
method Complex-valued Variational AutoEncoder (CVAE) trained on clutter-plus-noise, whitening, ANMF fusion.
result CVAE yields higher detection probability Pd at matched false-alarm rate Pfa, especially with whitening.

Proposes σσ-PCA to learn identifiable linear transformations without whitening.

problem Cannot identify axes with equal variances in PCA.
method Unified model for linear and nonlinear PCA, introducing a missing piece to eliminate rotational indeterminacy.
result Eliminates subspace rotational indeterminacy in PCA.

The smoothing theory is revised to generalize to different disc embedding spaces.

problem Generalizing the smoothing theory to various disc embedding spaces.
method Revising the Morlet-Burghelea-Lashof-Kirby-Siebenmann theorem to apply to different versions of disc smooth embedding spaces.
result The delooping of disc embedding spaces is shown to be compatible with the Hatcher and Budney actions.

Interneurons improve learning in neural networks by accelerating convergence.

problem Rapid adaptation to changing input statistics in neural networks.
method Two mathematically tractable recurrent linear neural networks were compared: one with direct recurrent connections and the other with interneurons that mediate recurrent communication.
result The network with interneurons converges more quickly than the network with direct recurrent connections, scaling logarithmically with initialization spectrum.

Collaborative filtering (CF) is a popular technique in today's recommender systems, and matrix approximation-based CF methods have achieved great success in both rating prediction and top-N recommendation tasks. However, real-world user-item rating matrices are typically sparse, incomplete and noisy, which introduce ch…

2018-11-06abs ↗pdf ↗

There are a multitude of methods to perform multi-set correlated component analysis (MCCA), including some that require iterative solutions. The methods differ on the criterion they optimize and the constraints placed on the solutions. This note focuses perhaps on the simplest version, which can be solved in a single s…

2018-02-11abs ↗pdf ↗

Sharp-SSL uses random projections to identify important variables for semi-supervised learning.

problem High-dimensional semi-supervised learning problems.
method Careful aggregation of low-dimensional results from many axis-aligned random projections.
result Sharp-SSL algorithm can recover signal coordinates with high probability.

Novel framework synthesizes stochastic trajectories with anticipated structural breaks.

problem Synthesizing forward-looking, time-evolving stochastic trajectories with anticipated structural breaks.
method Anticipatory Neural Jump-Diffusion (ANJD) flow, AVNSG for dynamic spectral whitening.
result The framework effectively captures non-commutative moments and high-order stochastic texture.

Normalized nonnegative models assign probability distributions to users and random variables to items; see [Stark, 2015]. Rating an item is regarded as sampling the random variable assigned to the item with respect to the distribution assigned to the user who rates the item. Models of that kind are highly expressive. F…

2015-11-20abs ↗pdf ↗

New method extracts biological concepts from cell microscopy images.

problem Extracting meaningful concepts from vision foundation models trained on cell microscopy images.
method Sparse dictionary learning (DL) combined with PCA whitening pre-processing.
result Successfully retrieved biologically meaningful concepts like cell types and genetic perturbations.