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

1223 · Jul 201119922001200920172026
47 results for DiffEqFlux.jl

DiffEqFlux.jl integrates neural networks with differential equations.

problem Combining machine learning and differential equations for modeling complex systems.
method Fusing neural networks and differential equations using DiffEqFlux.jl.
result Demonstrates the integration of differential equations into neural networks and vice versa.

Unified analysis simplifies Johnson-Lindenstrauss lemma for data reduction.

problem Efficiently reducing high-dimensional data while preserving geometry.
method Unified analysis of various JL constructions using probabilistic tools.
result First rigorous proof and extension of spherical construction's effectiveness.

In this paper, we study a fast approximation method for {\it large-scale high-dimensional} sparse least-squares regression problem by exploiting the Johnson-Lindenstrauss (JL) transforms, which embed a set of high-dimensional vectors into a low-dimensional space. In particular, we propose to apply the JL transforms to …

2015-07-18abs ↗pdf ↗

We introduce the concept of "negative bubbles" as the mirror image of standard financial bubbles, in which positive feedback mechanisms may lead to transient accelerating price falls. To model these negative bubbles, we adapt the Johansen-Ledoit-Sornette (JLS) model of rational expectation bubbles with a hazard rate de…

2010-03-30abs ↗pdf ↗

Financial markets are well known for their dramatic dynamics and consequences that affect much of the world's population. Consequently, much research has aimed at understanding, identifying and forecasting crashes and rebounds in financial markets. The Johansen-Ledoit-Sornette (JLS) model provides an operational framew…

2011-07-30abs ↗pdf ↗

We applied the Johansen-Ledoit-Sornette (JLS) model to detect possible bubbles and crashes related to the Brexit/Bremain referendum scheduled for 23rd June 2016. Our implementation includes an enhanced model calibration using Genetic Algorithms. We selected a few historical financial series sensitive to the Brexit/Brem…

2016-06-22abs ↗pdf ↗

This paper surveys various methods for dimensionality reduction and nearest neighbor search.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving essential information.
method Linear and nonlinear random projections, including sparse random projections, random Fourier Features, and Random Kitchen Sinks.
result Various methods for dimensionality reduction and nearest neighbor search are explained and compared.

Automates feature extraction from JSON data for machine learning.

problem Manual feature engineering for JSON data is laborious, lossy, and prone to bias.
method Automates feature extraction using Mill.jl and JsonGrinder.jl.
result Creates a differentiable machine learning model from raw JSON samples.

This work improves tensor decomposition methods, especially for large datasets.

problem Lack of efficient methods for estimating Tucker decompositions.
method Applies Johnson-Lindenstrauss type guarantees to Tucker decompositions with random embeddings.
result Effective dimension reduction with minimal error for large tensors.

Leverage is strongly related to liquidity in a market and lack of liquidity is considered a cause and/or consequence of the recent financial crisis. A repurchase agreement is a financial instrument where a security is sold simultaneously with an agreement to buy it back at a later date. Repurchase agreements (repos) ma…

2010-11-01abs ↗pdf ↗

We present an extension of the Johansen-Ledoit-Sornette (JLS) model to include an additional pricing factor called the "Zipf factor", which describes the diversification risk of the stock market portfolio. Keeping all the dynamical characteristics of a bubble described in the JLS model, the new model provides additiona…

2011-07-05abs ↗pdf ↗

New algorithm trains neural networks in near-linear time, overcoming slow convergence issues.

problem Slow convergence and computational overhead in training deep neural networks.
method Reformulates Gauss-Newton iteration as an ℓ2-regression problem and uses Fast-JL dimension reduction.
result Achieves an O(mn)-time algorithm for training ReLU networks, near-linear in dimension.

A new evolutionary algorithm improves k-means clustering by recombining the entire population.

problem Optimizing the k-means clustering problem, especially in non-convex cases.
method Recombinator-k-means uses stochastic recombination with a reweighting mechanism.
result Recombinator-k-means outperforms standard genetic algorithms in optimization objective.

Cryptocurrencies like Bitcoin and Ether show signs of financial bubbles, leading to market crashes.

problem Cryptocurrencies' price volatility and potential for financial bubbles.
method Applied quantitative models including Log Periodic Power Law and Phillips-Shi-Yu tests.
result Bitcoin and Ether exhibit bubble characteristics, predicting market crashes.

Algorithm approximates functions into manifolds with curvature bounds.

problem Approximating functions into manifolds with lower curvature bounds.
method Algorithm using manifold exponential and logarithm, with error bounds based on sectional curvature.
result Error bounds for nonnegative sectional curvature are similar to linear space approximations.

Neural networks approximate high-dimensional functions better than theory predicts.

problem Current theory struggles to explain why small neural networks work well in high-dimensional inverse problems.
method Bounding complexity required for neural networks to approximate Hölder or uniformly continuous functions on high-dimensional sets.
result A general theoretical framework explaining empirical successes of smaller networks in inverse problems.

Paper uses random projection to preserve subspace structure for efficient data analysis.

problem Efficiently analyzing data with low-dimensional structure.
method Compressed Subspace Learning (CSL) framework based on Johnson-Lindenstrauss property.
result Random projection preserves the UoS structure of data, enabling efficient analysis.

We present POLO --- a C++ library for large-scale parallel optimization research that emphasizes ease-of-use, flexibility and efficiency in algorithm design. It uses multiple inheritance and template programming to decompose algorithms into essential policies and facilitate code reuse. With its clear separation between…

2018-10-08abs ↗pdf ↗

PNN-smoothing improves kk-means clustering by merging subsets' clusterings.

problem Improving kk-means clustering initialization efficiency and effectiveness.
method Split dataset into subsets, cluster each subset, merge with PNN method.
result PNN-smoothing enhances kk-means++ seeding, reducing costs.

Bayesian framework improves minority class performance in class-imbalanced data.

problem Class imbalance in predictive toxicology models.
method Weighted likelihood approach modifying likelihood function weights inversely proportional to class proportions.
result Improves balanced accuracy and sensitivity for minority class (toxic compounds).

Paper proposes a new method for robust speaker verification.

problem Improving robustness in speaker verification systems.
method Combines soft VAD and self-adaptive VAD with DNN-based VAD.
result Significant improvement in verification performance in real-world environments.

QMME balances cost and speed in convex optimization.

problem Slow convergence of first-order methods and high cost of second-order methods.
method Minimizing quadratic majorants with fixed curvature at each iteration.
result QMME framework achieves sequential convergence under standard assumptions.

High throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data…

2017-10-23abs ↗pdf ↗

Extends DCP framework to Hadamard manifolds for geodesically convex functions.

problem Verifying convexity in nonlinear programs on Hadamard manifolds.
method Introduces Disciplined Geodesically Convex Programming (DGCP) framework, defining compositions and transformations for geodesically convex functions.
result Allows verification of geodesic convexity for a broader range of functions, including statistical estimators and matrix-valued optimization.

We present a plausible micro-founded model for the previously postulated power law finite time singular form of the crash hazard rate in the Johansen-Ledoit-Sornette model of rational expectation bubbles. The model is based on a percolation picture of the network of traders and the concept that clusters of connected tr…

2016-01-28abs ↗pdf ↗

A new framework for time series analysis using state-space learning.

problem Ineffectiveness of traditional Kalman filtering in handling big data and multiple explanatory variables.
method State Space Learning (SSL) framework using statistical learning for high-dimensional regression.
result SSL outperforms traditional methods in subset selection and forecasting accuracy.