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

4794141188 · May 202619922001200920172026
48 results for signal alignment

Deep neural networks show some layers better align with data than others.

problem Understanding why some layers in deep neural networks better align with data.
method Introducing the Equilibrium Hypothesis to connect alignment pattern to signal propagation.
result The Equilibrium Hypothesis explains the ascent-descent pattern of alignment in deep neural networks.

Alignment of neural network representations is influenced by SNR and sample size.

problem Understanding how neural network representations align across different conditions.
method Controlled training of neural networks on perturbed datasets, analyzing alignment and generalization.
result Alignment varies monotonically with SNR but non-monotonically with sample size, with minimal alignment near the interpolation threshold.

A new method for automatically aligning and clustering time series data.

problem Challenges in aligning and clustering time series data, especially without a template signal.
method TROUT (Temporal Registration using Optimal Unitary Transformations) method based on a novel dissimilarity measure.
result TROUT outperforms competitors in clustering time series data.

Paper introduces MSA for weakly supervised covariance alignment in MEG signals.

problem Limited labeled signals in target datasets for MEG applications.
method Mixing model Stiefel Adaptation (MSA) leveraging unlabeled data.
result MSA outperforms recent methods in brain-age regression with MEG signals.

The presence of noise is common in signal processing regardless the signal type. Deep neural networks have shown good performance in noise removal, especially on the image domain. In this work, we consider deep neural networks as a denoising tool where our focus is on one dimensional signals. We introduce an encoder-de…

2018-12-20abs ↗pdf ↗

Study analyzes Hotelling-type tensor deflation for spiked tensors, providing insights into signal and noise.

problem Characterizing singular values and alignments in Hotelling-type tensor deflation.
method Asymptotic study of Hotelling-type tensor deflation in large dimensional regime using random tensor theory.
result Characterization of singular values and alignments at each step of the deflation procedure.

Proposes a method for coarse graph alignment using sparse partial least squares.

problem Aligning graphs with community structures when there's no natural one-to-one mapping.
method Sparse partial least squares method incorporating observed graph structures and imposing sparsity.
result Demonstrates effectiveness in simulations.

New method separates graph structure from node attributes to recover lost signal.

problem Standard representation learning on attributed graphs merges incompatible metric spaces, leading to geometrically flawed alignment.
method Custom variational autoencoder that separates manifold learning from structural alignment.
result Transforms geometric conflict into interpretable structural descriptor, uncovering connectivity patterns and anomalies.

The paper shows that causal identification is not essential for efficient portfolios, focusing on geometric sufficiency conditions.

problem The necessity of causal identification for efficient portfolios.
method Re-examination of predictive signals and their impact on portfolio efficiency under structural misspecification.
result Efficiency is governed by geometric sufficiency conditions (directional alignment, ranking preservation, and calibration) rather than causal identification.

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an explicit expression of the Wasserstein distance between graph s…

2019-06-05abs ↗pdf ↗

We analyze why some models resist unlearning using linear stability theory.

problem Understanding and predicting when machine learning models resist unlearning.
method Linear stability theory applied to machine learning models, focusing on data coherence and optimization dynamics.
result Data coherence and signal-to-noise ratio (SNR) influence unlearning resistance; lower SNR makes unlearning easier.

This work optimizes signal estimation for sparse MRA with collision-free signals.

problem Recovering an unknown signal from repeated observations under cyclic isometries with high noise.
method Investigates minimax optimality for collision-free signals in the MRA model.
result The minimax optimal rate of estimation is \( \sigma^2/\sqrt{n} \) for sparse MRA.

Study on estimating signals from shifted and noisy copies in high dimensions, revealing a phase transition.

problem Estimating a signal in high-dimensional space from its circularly-shifted and noisy copies.
method Analysis of sample complexity in the high-dimensional regime, focusing on the parameter α.
result A phase transition phenomenon governed by α, with different sample complexities based on α values.

DET unifies geometric and functional alignment for high-dimensional scientific data.

problem Challenges in nonrigid registration for high-dimensional, irregular data.
method Domain Elastic Transform (DET) treats data as functions on irregular domains, using a Bayesian framework for elastic motion registration.
result DET achieves 92% topological preservation on MERFISH data and successfully registers whole-embryo Stereo-seq atlases.

Paper introduces a new metric to select optimal Graph Shift Operator for GNNs.

problem Empirical selection of Graph Shift Operator remains challenging.
method Introduces a novel alignment gain metric connecting geometric distortion to generalization bounds via spectral proxy.
result Provides a principled, computation-efficient criterion to rank and select optimal GSO.

PCA++ improves robustness to background noise in contrastive learning.

problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.

Time-continuous dimensional descriptions of emotions (e.g., arousal, valence) allow researchers to characterize short-time changes and to capture long-term trends in emotion expression. However, continuous emotion labels are generally not synchronized with the input speech signal due to delays caused by reaction-time, …

2019-07-05abs ↗pdf ↗

FreSh shifts model's initial frequency spectrum to match target signal, improving neural representation performance.

problem MLPs' low-frequency bias limits capturing high-frequency details accurately.
method FreSh selects embedding hyperparameters to align model's initial output spectrum with target signal's spectrum.
result FreSh improves performance across various neural representation methods and tasks with minimal computational overhead.

Fine-tuning LLMs with observational data can lead to spurious correlations, but DeconfoundLM can mitigate this.

problem Aligning LLMs with human preferences and business objectives using observational data.
method DeconfoundLM, a method that removes confounders from reward signals.
result DeconfoundLM improves recovery of causal relationships and mitigates spurious correlations.

Self-distillation improves constrained language generation by aligning models with target distributions.

problem Sparse and uninformative reward signals in constrained generation settings.
method Iteratively refining the base model through self-distillation, incorporating learned twist functions and proposals.
result Substantial gains in generation quality through improved model alignment with target distributions.

This paper improves MI-based BCIs by applying transfer learning across all components.

problem Reducing calibration effort for new subjects in MI-based BCIs.
method Proposes TL in spatial filtering, feature engineering, and classification blocks, and adds data alignment.
result Integrating data alignment and sophisticated TL significantly improves classification performance and reduces calibration effort.

Study detects signal in financial stock correlations using phase-ordering kinetics.

problem Detecting meaningful signals in financial stock return correlations.
method Stochastic field theory model to establish a detection threshold.
result Detection of a signal in the largest eigenvalues of the stock return correlation matrix.

New framework aligns latent representations over-the-air using intelligent metasurfaces.

problem Heterogeneous transmitter-receiver models produce misaligned latent representations in semantic communication.
method Intelligent metasurfaces (SIM) emulate supervised and zero-shot semantic aligners directly in the wave domain.
result SIMs achieve up to 90% task accuracy in high SNR regimes, robust to low SNR.

Proposes a method to compare noisy high-dimensional datasets with low-dimensional manifolds.

problem Comparing distributions on manifolds in noisy high-dimensional datasets.
method Linking low-rank structure to manifold geometry, developing a scale-invariant distance measure.
result Superior robustness and statistical power compared to existing methods.

The goal of dynamic time warping is to transform or warp time in order to approximately align two signals together. We pose the choice of warping function as an optimization problem with several terms in the objective. The first term measures the misalignment of the time-warped signals. Two additional regularization te…

2019-05-30abs ↗pdf ↗

A new principle for optimizer selection improves training speed and performance.

problem Finding the best optimizer hyperparameters for faster training.
method Formulate optimizer selection as maximizing the expected drop rate in loss, treating gradients and updates as signals and an optimizer as a causal filter.
result Greedy optimizer selection yields stable and effective momentum rules.

This work introduces a new metric to assess the fidelity of surrogate models to the underlying data-generating signal.

problem The limitations of fidelity-based explanations in explainable AI.
method Introduces the linearity score λ(f)λ(f) to quantify the extent of a regression network's linear decodability.
result High-fidelity surrogates can underperform compared to simpler models and even linear baselines trained directly on the data.

Statistical-computational gap found in aligning multiple Gaussian graphs.

problem Aligning multiple Gaussian graphs with unknown signals.
method Generalized informational threshold and computational barrier analysis.
result Existence of a statistical-computational gap in multiple Gaussian graph alignment.

Study analyzes accuracy of tensor deflation in noisy conditions.

problem Analyzing accuracy of tensor deflation in noisy conditions.
method Asymptotic study of Hotelling-type tensor deflation in large tensor dimensions.
result Characterization of estimated singular values and singular vector alignments.

New findings show sparse signals in MRA model require fewer measurements than previously thought.

problem Learning an unknown signal from repeated noisy images under group actions.
method Enhanced probabilistic method and analysis of uniform uncertainty principles.
result Sparse signals exhibit intermediate σ4σ^4 sample complexity, improving over traditional σ2σ^2.

Framework controls uncertainty in LLMs without labels or probabilities.

problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.

A new framework for averaging spatio-temporal signals using optimal transport and soft alignments.

problem Averaging complex datasets with time and spatial components.
method Inspired by DTW, OT, and UOT, a new loss function is proposed to address shifts in time, space, and population size.
result The proposed loss function can be used to compute spatio-temporal barycenters efficiently.

Study eigenvalues and eigenvectors in neural networks, focusing on signal propagation.

problem Characterize signal eigenvalues and eigenvectors in neural networks.
method Characterizes signal eigenvalues and eigenvectors for a nonlinear spiked covariance model.
result Provides precise quantitative characterizations of signal eigenvalues and eigenvectors in neural networks.

SpecGD mitigates misalignment in phase retrieval models with anisotropic inputs.

problem Misalignment during gradient descent in phase retrieval models with anisotropic inputs.
method Spectral gradient descent modifies gradient updates to preserve directional information and remove spike amplification.
result SpecGD removes spike amplification, leading to stable alignment and accelerated noise contraction.

Geometric framework detects concept frustration between human concepts and machine representations.

problem Aligning human concepts with machine learning representations.
method Geometric framework and similarity measures for detecting concept frustration.
result Concept frustration affects machine learning model performance and reorganizes learned concept representations.

FinRLlama wins FinRL Challenge 2024 by fine-tuning LLMs with market data.

problem Lack of contextual alignment for financial market applications in traditional LLMs.
method Fine-tuning LLaMA-3.2-3B-Instruct model with custom RLMF prompt design integrating historical data and reward feedback.
result RLMF-tuned FinRLlama framework outperforms baseline methods in signal consistency and trading outcomes.