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

Trend · papers per month

3316639941,325 · Jun 202019922001200920172026
48 results for projected power method

PNDEs project neural dynamics onto constraint manifolds, improving accuracy and stability.

problem Learning dynamics from data without violating known constraints.
method Projecting the learned vector field onto the tangent space of the constraint manifold.
result PNDEs outperform existing methods in learning constrained dynamical systems.

Empirical study finds IT project costs follow a power-law distribution, exposing risk underestimation.

problem IT project cost overruns are underestimated due to normal distribution assumptions.
method Analyzed 5,392 IT projects to examine cost overruns following a power-law distribution.
result IT project cost overruns follow a power-law distribution with a fat tail of extreme overruns.

Low-rank structure have been profoundly studied in data mining and machine learning. In this paper, we show a dense matrix XX's low-rank approximation can be rapidly built from its left and right random projections Y1=XA1Y_1=XA_1 and Y2=XTA2Y_2=X^TA_2, or bilateral random projection (BRP). We then show power scheme can further…

2011-12-22abs ↗pdf ↗

The paper develops a method for forecasting power consumption at various levels of aggregation.

problem Forecasting power consumption at different levels of household aggregation.
method Three-step process: feature generation, aggregation, and projection.
result The method provides theoretical guarantees on prediction error and performs well on real data.

A new derivation is given of Branson's factorization formula for the conformally invariant operator on the sphere whose principal part is the k-th power of the scalar Laplacian. The derivation deduces Branson's formula from knowledge of the corresponding conformally invariant operator on Euclidean space (the k-th power…

2007-11-29abs ↗pdf ↗

The paper studies volumes of direct images for high tensor powers of ample bundles.

problem Understanding asymptotics of Monge-Ampère volumes for high tensor powers of ample line bundles.
method Analyzes the leading term of asymptotics and classifies bundles saturating a topological bound.
result Provides a characterization of bundles admitting projectively flat Hermitian structures in the case of high symmetric powers of ample vector bundles.

Markov chain Monte Carlo (MCMC) algorithms are simple and extremely powerful techniques to sample from almost arbitrary distributions. The flaw in practice is that it can take a large and/or unknown amount of time to converge to the stationary distribution. This paper gives sufficient conditions to guarantee that univa…

2014-11-05abs ↗pdf ↗

A new method tests variable significance without assuming model correctness.

problem Testing variable significance in the presence of complex interactions.
method Flexible nonparametric or machine learning methods to estimate conditional mean independence.
result Achieves minimax optimal rate in nonparametric testing problem.

The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-match…

2018-11-26abs ↗pdf ↗

The paper examines how nonlinear transformations affect ridge sets in manifold learning.

problem Understanding the impact of nonlinear transformations on ridge sets in manifold learning.
method Examined the effects of nonlinear transformations on ridge sets using mathematical proofs and numerical experiments.
result The inclusion relationship $\cR(f\circ p)\subseteq \cR(p)$ holds for strictly increasing and concave transformations, and the Hausdorff distance between transformed and non-transformed ridge sets is smaller.

Study slopes of direct images in complex manifolds, proving a Mehta-Ramanathan type theorem.

problem Distribution of Harder-Narasimhan slopes in direct image sheaves.
method Analyzing asymptotic distributions of slopes under base changes of families of complex projective manifolds.
result Asymptotic distribution of slopes can be recovered from base changes over generic curves.

Study resolvents of Bochner Laplacians on compact manifolds.

problem Analyzing the resolvents of Bochner Laplacians in the semiclassical limit.
method Introducing Heisenberg semiclassical pseudodifferential operators to study sections of line bundles.
result Resolvents and spectral projections of Bochner Laplacians are studied in the large power limit.

We propose fast approximations for the generalized sliced-Wasserstein distance.

problem Efficient approximation of the generalized sliced-Wasserstein distance in high dimensions.
method Deterministic approximations using random projections and concentration of measure results.
result One-dimensional projections of high-dimensional random vectors are approximately Gaussian.

Joint sparsity offers powerful structural cues for feature selection, especially for variables that are expected to demonstrate a "grouped" behavior. Such behavior is commonly modeled via group-lasso, multitask lasso, and related methods where feature selection is effected via mixed-norms. Several mixed-norm based spar…

2012-04-06abs ↗pdf ↗

Develops precise expressions for random projections for better machine learning tasks.

problem Improving the accuracy of dimensionality reduction in machine learning tasks.
method Exploits recent developments in spectral analysis of random matrices to derive accurate expressions for random projection matrices.
result Provides precise expressions that reflect the practical performance of sketching methods, including Gaussian and Rademacher sketches.

The paper counts conjugacy classes of loxodromic elements in Anosov subgroups with a power saving error term.

problem Counting conjugacy classes of loxodromic elements in Anosov subgroups.
method Interpreting Jordan projections as periods of a flow and proving exponential mixing.
result Proves a counting theorem with a power saving error term for conjugacy classes of loxodromic elements.

Paper studies binary random projections with controllable sparsity patterns for computational and accuracy advantages.

problem Improving computational efficiency and accuracy in random projections.
method Proposes two sparse binary projection models with controllable sparsity patterns.
result Significant computational advantages and improved accuracies in empirical evaluations.

Unified study of principal component analysis under various structured signal models.

problem Principal component analysis with structured signals.
method Unified analysis using the spiked Wishart model and projected power method.
result Established fundamental limits and demonstrated local convergence for structured signal models.

PPM improves graph matching for correlated Gaussian Wigner models with high probability.

problem Graph matching in the Correlated Gaussian Wigner model with edge correlations.
method Seeded projected power method (PPM) for iterative improvement of initial partial matches.
result PPM recovers ground-truth matching with high probability in O(log n) iterations if seed is close enough.

The paper examines properties of self-affine Sierpiński sponges using metric invariants.

problem Investigating properties of self-affine Sierpiński sponges using metric invariants.
method Examined through maximal power law property and perfectly disconnectedness.
result Characterized self-affine Sierpiński sponges by their metric properties.

Product models of low dimensional experts are a powerful way to avoid the curse of dimensionality. We present the ``under-complete product of experts' (UPoE), where each expert models a one dimensional projection of the data. The UPoE is fully tractable and may be interpreted as a parametric probabilistic model for pro…

2012-10-19abs ↗pdf ↗

A robust model handles up to 25% of outliers in time-series data for power flow calculations.

problem Handling outliers in time-series data for accurate power flow calculations.
method Robust data-driven process model with Schweppe-type generalized maximum likelihood estimator and projection statistics for outlier weighting.
result The model can handle up to 25% of outliers in the training data set.

In this paper, we study smooth complex projective varieties XX such that some exterior power rTX\bigwedge^r T_X of the tangent bundle is strictly nef. We prove that such varieties are rationally connected. We also classify the following two cases. If TXT_X is strictly nef, then XX isomorphic to the projective space $\…

2018-01-28abs ↗pdf ↗

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.

This paper aims to systematically and comprehensively initiate a foundation for using concepts from computational differential geometry as instruments for power flow computing and research. At this point we focus our discussion on the static case, with power flow equations given by quadratic functions defined on voltag…

2019-03-26abs ↗pdf ↗

Develops a two-sample test using projected Wasserstein distance to handle high-dimensional data.

problem Testing whether two high-dimensional samples come from the same distribution.
method Optimal projection to find a low-dimensional linear mapping that maximizes the Wasserstein distance between projected probability distributions.
result Characterizes the convergence rate of the projected Wasserstein distance and presents practical algorithms.

LightOn OPUs accelerate randomized numerical linear algebra, reducing computational costs.

problem Computational bottleneck in randomization step for large-scale linear algebra.
method Near constant-time linear random projections from LightOn OPUs.
result Significant acceleration of RandNLA algorithms with negligible precision loss.

New proof shows certain manifolds cannot have real projective structure.

problem Demonstrating certain manifolds do not admit real projective structures.
method Reproved classification of closed real projective manifolds with nilpotent holonomy groups, using octantizability concept.
result Proved RPn#RPn\mathbf{RP}^n \# \mathbf{RP}^n and some others do not admit real projective structures.

The paper proves structures for complex projective varieties with certain tangent bundle properties.

problem Characterizing complex projective varieties based on properties of their tangent bundles.
method Analyzing the positivity of exterior powers of tangent bundles and using étale covers.
result Complex projective varieties with nef exterior powers of tangent bundles are Fano fiber spaces over Abelian varieties.

Unified theory and debiasing framework for random oblique projections in high dimensions.

problem Systematic statistical bias in random oblique projections induced by sampling.
method Unified non-asymptotic theory and debiasing framework.
result Sharp bias--variance characterizations and improved approximation accuracy.