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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920182026
48 results for Phase Dependence

Convolutional neural networks learn phase-dependent frequency representations.

problem Capturing phase dependence in frequency representations for better signal analysis.
method Convolutional neural networks learn filters with different phases, which rectify to phase-dependent descriptors.
result Phase harmonics correlations can compressively represent signals with sparse wavelet coefficients.

Lowered regularity assumption for a phase-dependent Helfrich energy equation.

problem Analyzing the phase separation line of the Helfrich energy.
method Used a carefully chosen test function with a signed distance function.
result Regularity assumption lowered from C2C^2 to C1,1C^{1,1} for the phase separation line.

New phase harmonic covariance models capture non-Gaussian properties of stationary processes.

problem Capturing non-Gaussian properties of stationary processes using Fourier phase.
method Introduce phase harmonic covariance moments and maximum entropy models conditioned by these moments.
result Maximum entropy models from phase harmonic covariances improve image synthesis of turbulent flows.

Clarifies method of phase synchronization for decoupling linear differential equations.

problem Velocity-dependent transformations in linear second-order differential equations.
method Linear transformation of coordinates and velocities.
result Velocity-dependent transformations do not preserve second-order character and define their own system.

We consider a Canham-Helfrich-type variational problem defined over closed surfaces enclosing a fixed volume and having fixed surface area. The problem models the shape of multiphase biomembranes. It consists of minimizing the sum of the Canham-Helfrich energy, in which the bending rigidities and spontaneous curvatures…

2012-04-30abs ↗pdf ↗

The stability of money value is an important requisite for a functioning economy, yet it critically depends on the actions of participants in the market themselves. Here we model the value of money as a dynamical variable that results from trading between agents. The basic trading scenario can be recast into an Ising t…

2001-10-10abs ↗pdf ↗

New algorithm reduces regret by allowing free exploration in multi-armed bandits.

problem Designing an adaptive policy to minimize regret with a free exploration budget.
method Introduced (α,β)(α,β)-probably saving policies and a two-phase algorithm UFE-KLUCB-H.
result UFE-KLUCB-H accumulates strictly less regret than non-free exploration policies.

This research examines how the error rate of nearest neighbor classifiers varies with dataset size.

problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.

Study phase transitions in shuffled regression problems.

problem Phase transitions in shuffled regression problems.
method Transformed permutation recovery into probabilistic graphical model, used message passing (MP) algorithm and branching random walk process.
result Characterized impact of signal-to-noise-ratio ($\snr$) on permutation recovery, proposed Gaussian approximation method.

Describes reconstructing Poisson structures from Lie group actions.

problem Reconstructing invariant Poisson structures from Lie group actions.
method Describes reconstruction of invariant Poisson structures from canonical actions of compact Lie groups on fibered phase spaces.
result Derives symmetry properties of Wong's type equations from main results.

Yard-Sale (YS) is a stochastic multiplicative wealth-exchange model with two phases: a stable one where wealth is shared, and an unstable one where wealth condenses onto one agent. YS is here studied numerically on 1d rings, 2d square lattices, and random graphs with variable average coordination, comparing its propert…

2012-08-22abs ↗pdf ↗

Descending phase retrieval algorithms show a phase transition with increasing sample complexity.

problem Theoretical limits of descending phase retrieval algorithms.
method Utilizing Random duality theory (RDT), the study develops a generic program to characterize algorithm performance.
result As sample complexity increases, the parametric manifold transitions from multi to single funneling points, leading to a phase transition in algorithm success.

Proves smoothness and estimates for special Lagrangian solutions with semi-convexity.

problem Smoothness and estimates for special Lagrangian solutions.
method Viscosity solutions, smoothness, interior derivative estimates, sharpness of conditions.
result New Liouville theorem and effective Hessian estimates for special Lagrangian solutions.

This paper presents a phase diagram for two-layer neural networks under different initialization scales.

problem Understanding the behavior of neural networks under varying scales of initialization.
method Analysis of a phase diagram for two-layer neural networks.
result Condensation of weight vectors on isolated orientations during training.

We present a simple model of firm rating evolution. We consider two sources of defaults: individual dynamics of economic development and Potts-like interactions between firms. We show that such a defined model leads to phase transition, which results in collective defaults. The existence of the collective phase depends…

2009-04-28abs ↗pdf ↗

Large GD stepsizes improve margins and speed up training for non-homogeneous networks.

problem Training efficiency and margin improvement in non-homogeneous two-layer networks.
method Investigation of two distinct phases in GD training, showing margin growth and empirical risk decrease.
result Large GD stepsizes lead to faster convergence and improved margins in non-homogeneous networks.

We find optimal learning rate schedules for a random feature model.

problem Choosing optimal learning rates for deep learning models.
method We analyze a powerlaw random feature model trained with SGD, considering optimal schedules as numerical and analytical problems.
result We discover two regimes: easy and hard phases, with different optimal learning rate schedules.

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.

We analyze the stock prices of the S&P market from 1987 until 2012 with the covariance matrix of the firm returns determined in time windows of several years. The eigenvector belonging to the leading eigenvalue (market) exhibits in its long term time dependence a phase transition with an order parameter which can be in…

2013-06-11abs ↗pdf ↗

Characterizes RFF regression in large n,p,Nn,p,N setting, providing precise learning phases and double descent curve.

problem Characterizes RFF regression in large n,p,Nn,p,N setting.
method Characterizes the exact asymptotics of random Fourier feature (RFF) regression in the realistic setting of large n,p,Nn,p,N.
result Characterizes two qualitatively different phases of learning and the corresponding double descent test error curve.

The usual formulations of time-dependent mechanics start from a given splitting Y=R×MY=R\times M of the coordinate bundle YRY\to R. From physical viewpoint, this splitting means that a reference frame has been chosen. Obviously, such a splitting is broken under reference frame transformations and time-dependent canonical …

1997-02-25abs ↗pdf ↗

We study the problem of approximate ranking from observations of pairwise interactions. The goal is to estimate the underlying ranks of nn objects from data through interactions of comparison or collaboration. Under a general framework of approximate ranking models, we characterize the exact optimal statistical error …

2017-11-30abs ↗pdf ↗

We study the convolutional phase retrieval problem, of recovering an unknown signal xCn\mathbf x \in \mathbb C^n from mm measurements consisting of the magnitude of its cyclic convolution with a given kernel aCm\mathbf a \in \mathbb C^m . This model is motivated by applications such as channel estimation, optics, and u…

2017-12-03abs ↗pdf ↗

In this note we revisit the subject of anomaly cancelation in string theory and M-theory on manifolds with String structure and give three observations. First, that on String manifolds there is no E8 x E8 global anomaly in heterotic string theory. Second, that the description of the anomaly in the phase of the M-theory…

2008-07-30abs ↗pdf ↗

PH-VAE models heavy-tailed data with flexible Phase-Type distributions.

problem Standard VAEs fail to capture heavy-tailed behavior in real-world data.
method PH-VAE uses Phase-Type distributions defined by continuous-time Markov chains to adaptively model tail behavior.
result PH-VAE significantly outperforms existing heavy-tail-aware VAEs in approximating diverse heavy-tailed distributions.

A learning algorithm optimizes beamforming for holographic transceivers in far-field communication.

problem Optimal phase-shifts for beamforming in holographic transceivers are challenging due to unknown receiver locations and large phase-shifts.
method Developed a learning algorithm using a fixed-budget multi-armed bandit framework to learn optimal phase-shifts.
result The algorithm, HoloBeam, outperforms state-of-the-art methods in beamforming optimization.

Study of two-layer ReLU neural network phase diagram at infinite-width limit.

problem Characterize the dynamical regimes of two-layer ReLU neural networks.
method Combining experimental and theoretical approaches, including phase diagram analogy.
result Identification of three regimes: linear, critical, and condensed.

PolarBM models complex-valued audio signals in polar coordinates, improving over conventional methods.

problem Discarding structural information in complex-valued problems simplifies models but loses important amplitude-phase relationships.
method Proposes PolarBM, a novel Boltzmann machine for complex-valued variables in polar coordinates, and LogPolarBM for logarithmic amplitude.
result PolarBM and LogPolarBM achieve superior modeling accuracy compared to conventional models, including deep neural networks.

Deep neural network estimates support of sparse signals for improved phase retrieval.

problem Sparse phase retrieval from Fourier magnitudes with support estimation.
method Trained deep neural network (DNN) provides extended support estimate E\mathcal{E} larger than the support T\mathcal{T}.
result DNN-based support estimation improves signal reconstruction performance with lower complexity.

This article presents results from the first statistically significant study of causes of cost escalation in transport infrastructure projects. The study is based on a sample of 258 rail, bridge, tunnel and road projects worth US$90 billion. The focus is on the dependence of cost escalation on (1) length of project imp…

2013-04-16abs ↗pdf ↗

Study reconstructs Riemannian metric from Cherenkov radiation in complex media.

problem Reconstructing internal geometry of inhomogeneous anisotropic targets.
method Mathematical model of waves in medium, including vector-valued wave operator and phase velocity.
result Riemannian metric inside a bounded region can be reconstructed from boundary measurements of Cherenkov radiation.

The Gerber-Shiu function provides a way of measuring the risk of an insurance company. It is given by the expected value of a function that depends on the ruin time, the deficit at ruin, and the surplus prior to ruin. Its computation requires the evaluation of the overshoot/undershoot distributions of the surplus proce…

2017-01-10abs ↗pdf ↗

Noise can stabilize systemic risk models with uncertain robustness.

problem Understanding systemic risk in financial systems with uncertain parameters.
method Analyzing a mean-field model of systemic risk with uncertain coefficients and noise.
result Noise can induce stability in systemic risk models, contrary to intuition.

Study reveals phase transition in neural networks near interpolation.

problem Understanding generalization and learning transitions in neural networks.
method Effective theory for approximating Bayes-optimal generalisation error.
result Unveils a discontinuous phase transition between universal and specialisation phases.

DSTP-RNN improves long-term multivariate time series prediction using attention-based RNN.

problem Long-term prediction of multivariate time series with spatial correlations and spatio-temporal relationships.
method Inspired by human attention mechanism, DSTP-RNN uses a dual-stage two-phase structure and multiple attentions to enhance spatial correlations and long-term dependence.
result DSTP-RNN outperforms nine baseline methods on four datasets in energy, finance, environment, and medicine.

We study the feasibility and noise sensitivity of portfolio optimization under some downside risk measures (Value-at-Risk, Expected Shortfall, and semivariance) when they are estimated by fitting a parametric distribution on a finite sample of asset returns. We find that the existence of the optimum is a probabilistic …

2008-11-05abs ↗pdf ↗