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

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920172026
48 results for phase information

Complex-valued neural networks improve seismic data analysis by preserving phase information.

problem Low-frequency aliasing in seismic data due to discarded phase information.
method Developed complex-valued deep convolutional networks to leverage phase information in deterministic physical data.
result Complex-valued networks outperform real-valued networks in training and inference from deterministic physical data.

Paper improves phase identification in power systems using information theory.

problem Improving supervised learning accuracy in phase identification.
method Developed two new techniques based on information theory.
result Significant improvement in phase identification accuracy (e.g., from 51.7% to 97.3%).

The paper studies phase transitions in Information Bottleneck for representation learning.

problem Understanding the behavior of compression and prediction terms in IB objective.
method Studied phase transitions in IB objective using second-order calculus of variations and Fisher information matrix.
result IB phase transitions correspond to learning new classes and are related to maximum correlation between input and target orthogonal to the learned representation.

Sharp asymptotics derived for phase retrieval and compressed sensing with random generative priors.

problem Phase retrieval and compressed sensing with random measurement matrices.
method Sharp asymptotics derived for optimal performance and polynomial algorithm for random generative priors.
result Compressed phase retrieval becomes tractable with random generative priors, unlike sparse priors.

Study shows reverberant phase is not essential for weakly-supervised dereverberation.

problem Evaluating the role of reverberant phase in weakly-supervised dereverberation.
method Statistical Wave Field Theory and recent weak supervision framework.
result Wet phase carries limited useful information and is not essential for weakly supervised dereverberation.

Improved regret bounds for bandit phase retrieval.

problem Minimizing cumulative and simple regret in a bandit phase retrieval problem.
method Proved minimax cumulative and simple regret bounds using adaptive algorithms.
result Minimax cumulative regret is ildeΘ(dn) ilde{\Theta}(d \sqrt{n}) and minimax simple regret is ildeΘ(d/n) ilde{\Theta}(d / \sqrt{n}).

Paper tackles joint community detection and phase synchronization in stochastic block models.

problem Jointly recover cluster structure and phase angles in stochastic block models.
method Proposes two algorithms: a spectral method based on multi-frequency QR factorization and an iterative multi-frequency generalized power method.
result Proposed algorithms significantly improve recovery of cluster structure and phase angles compared to existing methods.

Paper analyzes latent space geometry in generative models using Fisher information.

problem Understanding the structure of latent spaces in generative models.
method Reconstructs Fisher information metric from generated samples and posterior distribution.
result Reveals fractal structure and abrupt changes in Fisher metric at phase boundaries.

An algorithmically hard phase was described in a range of inference problems: even if the signal can be reconstructed with a small error from an information theoretic point of view, known algorithms fail unless the noise-to-signal ratio is sufficiently small. This hard phase is typically understood as a metastable bran…

2018-05-15abs ↗pdf ↗

This study analyzes VAEs using ID and II, revealing a transition in behaviour and distinct training phases.

problem Understanding the hidden representations and training phases of VAEs.
method Analysis using Intrinsic Dimension (ID) and Information Imbalance (II).
result VAEs exhibit a transition in behaviour and distinct training phases when the bottleneck size exceeds the Intrinsic Dimension of the data.

The paper analyzes phase transitions in transfer learning for perceptrons.

problem Understanding when transfer learning from a source task to a target task is beneficial.
method Theoretical analysis of a pair of related perceptron learning tasks.
result Reveals a phase transition from negative to positive transfer as task similarity changes.

This paper shows how learning the phase-amplitude coupling improves bio-signal classification.

problem Discarding phase component in bio-signal feature extraction leads to poor generalization.
method Introducing a novel self-supervised learning task called Phase-Swap to detect phase-amplitude coupling.
result Neural networks trained on Phase-Swap task generalize better across subjects and recording sessions.

Persistent entropy detects phase transitions in complex systems.

problem Detecting phase transitions in complex systems.
method Established a general theorem for persistent entropy to reliably detect phase transitions, introduced operational framework for finite-time computations.
result Persistent entropy exhibits an asymptotically non-vanishing gap across phases, robust numerical signatures across experiments.

Improved statistical inference for expensive data using machine learning predictions.

problem Statistical inference under adaptive two-phase multiwave sampling with expensive measurements.
method Multiwave Predict-Then-Debias estimator combining proxy information and expensive measurements.
result Valid estimators and confidence intervals for M-estimation under adaptive sampling.

Neural networks learn simpler features first, then more complex ones; Fourier analysis reveals this pattern.

problem Understanding the learning dynamics of neural networks, especially with natural image data.
method Fourier analysis of translation-invariant and power-law spectra to study feature learning.
result Simple neural networks first rely on amplitude information, then phase information, and power-law spectra can accelerate learning phase information.

Near-optimal sample complexity for phase retrieval with generative priors.

problem Phase retrieval with magnitude-only measurements and sparse signals.
method Near-optimal sample complexity with i.i.d. Gaussian measurements and generative models.
result O(k log L) samples suffice for phase retrieval with generative priors.

We study graph matching with correlated Gaussian features and find thresholds for exact recovery.

problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.

We study the market impact of a meta-order in the framework of the Minority Game. This amounts to studying the response of the market when introducing a trader who buys or sells a fixed amount h for a finite time T. This perturbation introduces statistical arbitrages that traders exploit by adapting their trading strat…

2011-12-16abs ↗pdf ↗

Algorithm finds frequencies, amplitudes, and phases of sinusoids in noisy data.

problem Finding frequencies, amplitudes, and phases of sinusoids in noisy data.
method Maximum likelihood approach to estimate tone parameters from contaminated observations. Successively estimates frequencies and jointly optimizes amplitudes and phases.
result Near-linear computational complexity (O(N)) for estimating MM number of sinusoidal sources.

Review of information plane analyses in neural networks, highlighting mixed results and methodological challenges.

problem Understanding the relationship between information-theoretic compression and neural network performance.
method Literature review and detailed analysis of information quantity estimation methods.
result Information plane compression is not necessarily information-theoretic but compatible with geometric compression.

Method detects phase transitions in financial markets using eigenvalue decomposition.

problem Detecting tipping points and fluctuation patterns in financial markets.
method Eigenvalue decomposition and eigen-entropy from cross-correlation matrix.
result Market events undergo phase separation and order-disorder transitions.

We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients (np1n \gg p \gg 1). In this regime, optimization algorithms can immensely benefit from approximate second order information.…

2015-11-28abs ↗pdf ↗

Study on detecting hierarchical community structures in networks.

problem Detecting hierarchical community structures in networks.
method Analysis of planted hierarchies of partitions in networks, identifying additional detectability phases.
result There are additional phases in which the presence of multiple consistent partitions can either help or hinder detection of hierarchical structures.

Belief Propagation outperforms other algorithms in reconstructing binary symmetric channel trees.

problem Reconstructing binary symmetric channel trees with bounded memory.
method Combining recursive reconstruction, information theory, and optimal transport.
result Any recursive algorithm with bounded memory for the reconstruction problem on binary symmetric channel trees has a phase transition strictly below the Belief Propagation threshold.

Paper eliminates warm-up phase for PO in linear MDPs, achieving optimal regret.

problem Costly warm-up phase in PO algorithms for linear MDPs.
method Simple contraction mechanism replaces warm-up phase.
result Achieves rate-optimal regret with improved dependence on problem parameters.

New learning rate approach reveals phase transitions in SGD performance.

problem Understanding feature learning dynamics in neural networks.
method Characterizing the relationship between learning rate(s) and sample complexity for gradient-based algorithms.
result Phase transition from information exponent to generative exponent regime with different learning rates.

Early training phase affects deep neural network optimization and generalization.

problem The choice of learning rate influences generalization in deep learning models.
method Showed that SGD implicitly penalizes the trace of the Fisher Information Matrix (FIM) from the start of training, and explicitly penalizing the trace of FIM improves generalization.
result Catastrophic Fisher explosion (large trace of FIM early in training) is linked to poor generalization.

Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of (Gerchberg and Saxton 1972) and (Fienup 1982) is still the popular choice for solving many variants o…

2013-06-02abs ↗pdf ↗