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.

169,291 papers · 148 categories

Trend · papers per month

591418 · May 202619922001200920182026
48 results for cross-label suppression

The paper proposes a new dictionary learning method for faster and more accurate image classification.

problem Efficient and accurate image classification with compact dictionaries.
method Cross-label suppression and group regularization to learn a discriminative dictionary.
result The proposed method achieves better classification accuracy and computational efficiency compared to existing methods.

Contrastive learning struggles with class collapse and feature suppression, revealing bias towards simpler solutions.

problem Contrastive learning struggles with class collapse and feature suppression, especially in supervised and unsupervised settings.
method Unified theoretical framework to determine which features are learnt by CL, revealing bias towards simpler solutions.
result Bias towards simpler solutions is a key factor in class collapse and feature suppression.

Paper proposes a statistical model for detecting mu-suppression in EEG signals.

problem Detecting mu-suppression in motor imagery EEG signals.
method Proposes a statistical model based on the generalized extreme value distribution (GEV) and a linear classifier.
result Preliminary results show good classification accuracy in detecting mu-suppression and distinguishing EEG events.

Paper introduces VSSGD to balance deep learning training with variance suppression.

problem Unbalanced data leads to unbalanced training process in deep learning.
method Adaptively adjusts error variance and mean to balance training.
result VSSGD accelerates training, prevents overfitting, and improves learning from small samples.

Contrastive learning properties studied, including feature suppression and hierarchical learning.

problem Feature suppression and hierarchical learning in contrastive learning.
method Generalized contrastive loss, instance-based contrastive learning, explicit and controllable competing features.
result Contrastive learning can suppress and prevent the learning of competing features.

Paper proposes methods to reduce adversarial vulnerability in neural networks.

problem Adversarial vulnerability of deep neural networks in safety-critical applications.
method Defining vulnerability, proposing Vulnerability Suppression (VS) loss, and a Bayesian feature pruning method.
result Improves adversarial robustness and clean example performance with minimal parameter reduction.

DG separates successes and failures by gating updates with advantage and surprisal.

problem Negative learning from surprising data in distributed reinforcement learning.
method DG gates each update with the product of advantage and surprisal, suppressing failures and preserving successes.
result DG outperforms other methods in various challenging reinforcement learning tasks.

New method improves fairness in DP learning by preventing excessive gradient suppression.

problem Disparate impact on model predictions for minority groups in DP learning.
method Bounded adaptive clipping to prevent excessive gradient suppression.
result Improves worst-class accuracy by over 10 percentage points compared to existing methods.

Localized Multidirectional Correction improves non-refusal target-response behavior in foundation models.

problem Controlled post-training refusal suppression in routed MoE and hybrid-MoE foundation models.
method Introduce Localized Multidirectional Correction (LoMC), a support-gated intervention framework.
result Substantially improves non-refusal target-response behavior while maintaining general capability under a compact intervention footprint.

Bayesian method suppresses low-frequency pulses in audio recordings.

problem Suppressing long pulses caused by mechanical defects in audio recordings.
method Bayesian approach using Gaussian Process for pulse location, signal interpolation, and tail estimation.
result Perceptual results similar to previous methods, performs well on naturally degraded signals.

New model LMRC tackles class incremental learning without needing old classes.

problem Softmax suppression problem in class incremental learning.
method Label Mapping with Response Consolidation (LMRC) and multi-head neural network.
result LMRC achieves better performance than related methods in different scenarios.

Solves exploding and vanishing gradient problem in LSTMs.

problem Exploding and vanishing gradient problem in LSTM optimization.
method Introduces a simple stochastic algorithm (h-detach) to prevent suppression of gradient components through the cell state path in LSTM.
result Significant improvements in convergence speed, robustness, and generalization over vanilla LSTM training.

New methods validate a hypothesis explaining how neural nets generalize well.

problem Why over-parameterized nets generalize well despite memorizing training data.
method Developed new algorithms to suppress weak gradient directions without per-example gradients.
result Validated a hypothesis about gradient directions and their role in generalization.

M2M tackles zero-shot structured noise suppression in images.

problem Structured noise with strong anisotropic correlations in real-world images.
method M2M introduces a novel sampling strategy that generates pseudo-independent sub-image pairs from a single noisy input, using directional interpolation and generalized median filtering.
result M2M consistently outperforms state-of-the-art zero-shot methods under correlated noise.

SNAP improves robust computation by emphasizing trustworthy items and downweighting outliers.

problem Improving robustness in computation, especially in high-dimensional settings.
method SNAP assigns weights based on mutual agreement, suppressing outlier contributions.
result SNAP ensures outliers contribute negligibly to computations, even in high-dimensional settings.

Robust STAP with coprime arrays reduces clutter using sparse modeling.

problem Limited performance due to training samples support in practical applications.
method Two-stage approach: 1) RD virtual snapshot, 2) RD sparse measurement modeling with OMP-like recovery.
result Robust to prior knowledge errors, good clutter suppression performance.

Noise can affect the overparametrization of QNNs, enabling new directions but also suppressing sensitivity.

problem The overparametrization of QNNs in the presence of noise.
method Analyzing the Quantum Fisher Information Matrix (QFIM) to understand how noise affects the rank of QFIM.
result Noise can turn previously-zero eigenvalues of the QFIM to non-zero, enabling exploration of new directions.

Neuro-symbolic traders suppress market prices, highlighting risks to stability.

problem Understanding and quantifying the influence of AI-generated financial models on markets.
method Developed virtual neuro-symbolic traders using deep generative models and tested them in a virtual market.
result Neuro-symbolic traders suppress market prices compared to historical data, indicating potential market instability.

A simple method for estimating PMF on large supports, preserving structure and suppressing noise.

problem Nonparametric estimation of multi-modal, heavy-tailed PMF on large discrete support.
method Data-dependent low-pass filtering on a line graph Laplacian.
result Smooth, multi-modal estimate of PMF that preserves coarse structure and suppresses noise.

Study examines strategies to reduce volatility in leveraged ETF markets.

problem Rebalancing trades in leveraged ETFs can destabilize financial markets.
method Agent-based simulation to compare different trading strategies.
result Increasing the minimum number of orders in rebalancing trades reduces market volatility.

PatternLocal improves XAI for non-linear models by suppressing suppressor variables.

problem Suppressor variables cause false-positive feature attributions in non-linear models.
method PatternLocal uses locally linear surrogate models and transforms weights into a generative representation.
result PatternLocal reduces false-positive attributions and provides more reliable explanations.

Private estimation of density modes for multimodal distributions.

problem Estimating density modes under differential privacy constraints.
method DP-GRAMS, a mean-shift inspired method that performs noisy ascent on a differentially private score estimator.
result Private recovery of density modes with high probability and asymptotic error rates.

Universal adversarial patches prevent face detection in various frameworks.

problem Preventing face detection in state-of-the-art face detection systems.
method Investigated the phenomenon of patches that suppress face detection and proposed optimization-based approaches for automatic design.
result Universal adversarial patches can prevent face detection without introducing false positives.

A new neural network learns from acoustic scenes by suppressing irrelevant patterns.

problem Acoustic scenes are rich and redundant, making classification challenging.
method Spatio-temporal attention pooling layer coupled with a convolutional recurrent neural network.
result The method outperforms a strong convolutional neural network baseline and sets new state-of-the-art performance.

New method improves sparse regression interpretability by suppressing correlated variables.

problem Sparse regularization's sensitivity to feature correlations.
method Independently Interpretable Lasso (IILasso) regularizer.
result Improves interpretability and generalization by selecting uncorrelated variables.

LLMs prefer Bitcoin under crisis frames, affecting financial decisions.

problem Testing whether LLMs have built-in biases towards specific financial assets.
method Developed a three-level audit protocol to examine Bitcoin's representation and influence in LLMs.
result An identifiable internal feature in LLMs can be perturbed to move financial choices, but only within measurable limits.

Gradient-free optimizers are ineffective on barren plateaus in quantum computing.

problem Effect of barren plateaus on gradient-free optimization in quantum computing.
method Numerical simulations and theoretical analysis of gradient-free optimization algorithms.
result Gradient-free optimizers are not effective in barren plateau landscapes due to exponentially suppressed cost function differences.

Unified framework suppresses model bias in semi-supervised learning with decoupled sampling control.

problem Class imbalance in semi-supervised learning, especially with distributional mismatches.
method Unified framework SC-SSL with decoupled sampling control, explicit expansion capability, and adaptive sampling probabilities.
result Consistent and state-of-the-art performance across various benchmark datasets and distribution settings.

Paper presents a fast and adaptive filter for SI suppression in full-duplex transceivers.

problem Self-interference suppression in full-duplex transceivers with nonlinearity.
method Adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS).
result The proposed method achieves favorable digital SIC performance compared to benchmarks.

A model of open economics composed of producers and speculators is investigated by numerical simulations. The capital flows from the environment to the producers and from them to the speculators. The price fluctuations are suppressed by the speculators. When the aggressivity of the speculators grows, there is a transit…

1999-06-16abs ↗pdf ↗

Theory explains generalization in deep learning, reducing memorization and improving performance.

problem Understanding and improving generalization in deep learning models.
method Developed a non-asymptotic theory using the empirical neural tangent kernel.
result Generalization is possible even when the kernel evolves significantly, with coherent signal accumulation and noise suppression.

Learning rate decay helps modern neural networks by suppressing memorization and improving complex pattern learning.

problem Understanding the effectiveness of learning rate decay in training modern neural networks.
method Proposes a new explanation for lrDecay effectiveness based on network behavior and pattern complexity.
result Learning rate decay improves complex pattern learning and suppresses memorization of noisy data.

Random matrix theory improves financial market analysis by smoothing out noise.

problem Choosing an appropriate epoch for computing empirical cross-correlation matrices in financial markets.
method Power mapping to apply non-linear distortion to short epoch correlation matrices, controlling noise and removing degeneracy of zero eigenvalues.
result Interesting properties of eigenvalue spectra are found in simulated and empirical return matrices.

Based on the daily data of American and Chinese stock markets, the dynamic behavior of a financial network with static and dynamic thresholds is investigated. Compared with the static threshold, the dynamic threshold suppresses the large fluctuation induced by the cross-correlation of individual stock prices, and leads…

2010-02-18abs ↗pdf ↗