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

1.2%2.4%3.6%4.8% · Aug 199519922001200920172026
48 results for El Nino/Southern Oscillation

Graph neural networks improve El Niño forecasts.

problem Improving seasonal forecasting accuracy for El Niño-Southern Oscillation.
method Designing a novel graph connectivity learning module to model large-scale spatial interactions with ENSO forecasting.
result Our model \graphino outperforms state-of-the-art models for forecasts up to six months ahead.

Study improves seasonal forecasts using deep learning.

problem Challenges in generating large forecast ensembles and limited observations for verification.
method Developed a probabilistic deep neural network model.
result Demonstrated favorable skill compared to state-of-the-art dynamical forecast systems.

Paper models spatio-temporal extremes using conditional variational autoencoders.

problem Modeling co-occurrence of extreme weather events under changing climate conditions.
method Conditional Variational Autoencoder (cXVAE) with CNN integration.
result Accurately emulates spatial fields and recovers extremal dependence with low computational cost.

Proposes a new method combining Reservoir Computing and Normalizing Flow for predicting stochastic dynamical systems.

problem Predicting and capturing long-term behaviors of stochastic dynamical systems.
method Data-driven framework combining Reservoir Computing and Normalizing Flow, integrating error modeling and both approaches virtues.
result Successfully predicts the long-term evolution of stochastic dynamical systems and replicates dynamical behaviors.

Forecasting a time series from multivariate predictors constitutes a challenging problem, especially using model-free approaches. Most techniques, such as nearest-neighbor prediction, quickly suffer from the curse of dimensionality and overfitting for more than a few predictors which has limited their application mostl…

2015-06-18abs ↗pdf ↗

M-CaStLe discovers causal structures in multivariate space-time data.

problem Challenges in causal graph discovery for high-dimensional gridded data.
method Generalizes CaStLe to multivariate analyses, using local embeddings and pooling spatial replicates.
result More accurately recovers multivariate causal structure and identifies physical dynamics.

GOAL algorithm reduces and rotates feature space for small data classification.

problem Challenges in identifying important features for classification in small data settings.
method GOAL algorithm reduces and rotates feature space in a lower-dimensional gauge, providing an analytically tractable solution.
result GOAL algorithm outperforms state-of-the-art ML tools in synthetic and real-world applications.

Novel algorithm detects causal macrovariables from high-dimensional data.

problem Leveraging high-dimensional observational datasets for coarse-grained causal models.
method Inspired by information bottlenecks, novel algorithm detects macrovariables and investigates causal relationships through additive noise models.
result Algorithm robustly detects and infers causal relationships in both synthetic and real climate datasets.

Machine learning improves sub-seasonal climate forecasting, especially gradient boosting and deep learning.

problem Predicting climate variables like temperature and precipitation in 2-week to 2-month time scales.
method Carefully constructed feature representations and ML approaches including gradient boosting and deep learning.
result ML methods can outperform climatological baselines and improve prediction accuracy.

The study uses machine learning to predict CAT bond coupons based on climate data.

problem Predicting CAT bond coupons using climate data.
method Combining climate indicators with machine learning models (random forest, gradient boosting, etc.).
result Extremely randomized trees achieved the lowest RMSE in predicting CAT bond coupons.

Improved NiNo networks accelerate Adam training by up to 50%.

problem Accelerating neural network training with stable and efficient methods.
method Proposed NiNo networks that leverage neuron connectivity and graph neural networks to nowcast parameters periodically during Adam training.
result Accelerates Adam training by up to 50% in vision and language tasks.

Unlike major Western languages, most African languages are very low-resourced. Furthermore, the resources that do exist are often scattered and difficult to obtain and discover. As a result, the data and code for existing research has rarely been shared. This has lead a struggle to reproduce reported results, and few p…

2019-06-17abs ↗pdf ↗

Parameters defined via general estimating equations (GEE) can be estimated by maximizing the empirical likelihood (EL). Newey and Smith [Econometrica 72 (2004) 219--255] have recently shown that this EL estimator exhibits desirable higher-order asymptotic properties, namely, that its O(n1)O(n^{-1}) bias is small and that …

2007-08-14abs ↗pdf ↗

Develops an empirical likelihood framework for random forests and ensembles.

problem Quantifying the statistical uncertainty of random forests and ensembles.
method Empirical likelihood framework exploiting the incomplete UU-statistic structure of ensemble predictions.
result Modified empirical likelihood statistic achieves accurate coverage and practical reliability.

Deep learning models learn chaotic system dynamics from real and simulated data.

problem Training deep learning models for chaotic systems requires big data.
method Jointly train deep neural networks on real and simulated data, enforcing physical laws.
result Proposes knowledge-based deep learning (KDL) for accurate forecasting of chaotic systems.

Generalisation of the El Farol bar problem to that of many bars here leads to the Kolkata restaurant problem, where the decision to go to any restaurant or not is much simpler (depending on the previous experience of course, as in the El Farol bar problem). This generalised problem can be exactly analysed in some limit…

2007-05-15abs ↗pdf ↗

This paper presents practical methods for portfolio selection in investments.

problem Investment portfolio selection challenges.
method Mean-variance optimization, mean-semivariance model, genetic algorithms, transaction costs.
result More comprehensive risk and return analysis in portfolio selection.

We show that if S is a finite type orientable surface of genus g and p punctures where 3g+p > 4, then EL(S) is (n-1)-connected and (n-1)-locally connected where dim(PML(S))=2n+1=6g+2p-7. Furthermore, if g=0, then EL(S) is homeomorphic to the p-4 dimensional Nobeling space.

2011-05-18abs ↗pdf ↗

Efficiently estimates uncertainty for LLM-based entity linking in tabular data.

problem Accurate and reliable uncertainty estimates for LLM-based entity linking in tabular data.
method Self-supervised approach using token-level features for single-shot inference.
result Effective uncertainty estimates detected at a fraction of computational cost.

Statistical inference of analytically non-tractable posteriors is a difficult problem because of marginalization of correlated variables and stochastic methods such as MCMC and VI are commonly used. We argue that stochastic KL divergence minimization used by MCMC and VI is noisy, and we propose instead EL_2O, expectati…

2019-01-14abs ↗pdf ↗

The objective of this paper is to provide a comprehensive study no-arbitrage pricing of financial derivatives in the presence of funding costs, the counterparty credit risk and market frictions affecting the trading mechanism, such as collateralization and capital requirements. To achieve our goals, we extend in severa…

2017-01-29abs ↗pdf ↗

We study the geometric nature of the Jacobi equation. In particular we prove that Jacobi vector fields (JVFs) along a solution of the Euler-Lagrange (EL) equations are themselves solutions of the EL equations but considered on a non-standard algebroid (different from the tangent bundle Lie algebroid). As a consequence …

2012-05-27abs ↗pdf ↗

OL4EL optimizes edge learning on resource-constrained servers.

problem Resource constraints on edge servers hinder effective distributed machine learning.
method Online Learning for EL (OL4EL) framework using budget-limited multi-armed bandit model.
result OL4EL significantly improves learning performance while conserving resources.

Study examines boundedness of oscillating singular integrals on specific Lie groups.

problem Investigating boundedness of oscillating singular integrals on Lie groups of polynomial growth.
method Presented kernel criteria in terms of sub-Riemannian structure and Fourier analysis.
result Extended classical oscillating conditions for boundedness of oscillating convolution operators.

Log-periodic oscillations have been used to predict price trends and crashes on financial markets. So far two types of log-periodic oscillations have been associated with the real markets. The first type are oscillations which accompany a rising market and which ends in a crash. The second type oscillations, called "an…

2003-07-14abs ↗pdf ↗

Estimates box dimension of fractal interpolation surfaces using oscillation vectors.

problem Estimating the complexity of fractal interpolation surfaces.
method Defined vertical scaling matrices and used them to relate oscillation vectors of different levels.
result Obtained the box dimension of generalized affine fractal interpolation surfaces.

The Duffing oscillator's parameters are identified online using variational message passing.

problem Estimating parameters of a nonlinear Duffing oscillator in real-time.
method Variational message passing on a factor graph of the Duffing oscillator's generative model.
result The online inference procedure performs as well as offline methods.

The present paper introduces a majority orienting model in which the dealers' behavior changes based on the influence of the price to show the oscillation of stock price in the stock market. We show the oscillation of the price for the model by applying the van der Pol equation which is a deterministic approximation of…

2004-03-31abs ↗pdf ↗

The study derives generalization bounds for neural oscillators, improving their performance with regularization.

problem Quantifying the generalization capacities of neural oscillators.
method Using Rademacher complexity and squared Wasserstein-1 distances, the study derives theoretical upper PAC generalization bounds for neural oscillators.
result Theoretical bounds show polynomial growth in estimation errors with MLP size and time length, and regularization improves performance.

Study finds the spectrum of a cubic Dirac operator on specific oscillator group manifolds.

problem Determining the spectrum of a cubic Dirac operator on oscillator group manifolds.
method Explicit decomposition of the regular representation and calculation of eigenspaces.
result Explicit eigenspaces and spectrum of the cubic Dirac operator determined.

Study on black hole interiors with matter fields, showing oscillation condition impacts blow-up.

problem Examining Strong Cosmic Censorship in the presence of matter fields.
method Einstein equations coupled with charged/massive scalar fields, spherically symmetric data, relaxation rate analysis.
result Oscillation condition on event horizon determines whether matter fields blow up or not.

EL framework certifies and flags bias in ML models without distributional assumptions.

problem Systematic performance disparities across sensitive subpopulations in ML models.
method Empirical likelihood-based approach for non-parametric fairness auditing.
result EL framework outperforms bootstrap methods in certification and subpopulation discovery.