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

36912 · Oct 201919922001200920172026
48 results for CAC 40

The paper introduces a new model selection criterion for various time series models.

problem Designing adaptive model selection criteria for a wide range of time series models.
method The approach involves a penalized contrast akin to Hannan and Quinn's criterion, with a data-driven calibrated term.
result The new criteria select the true model almost surely asymptotically for a wide range of time series models.

Derives a new formula for measuring risk aversion in markets.

problem Measuring the degree of risk aversion in markets accurately.
method Closed-form expression based on three variables: Treasury yields, returns, and market capitalization.
result Investors exhibit Decreasing Absolute Risk Aversion (DARA) but the degree of Relative Risk Aversion (RRA) varies.

This paper analyses the behaviour of volatility for several international stock market indexes, namely the SP 500 (USA), the Nikkei (Japan), the PSI 20 (Portugal), the CAC 40 (France), the DAX 30 (Germany), the FTSE 100 (UK), the IBEX 35 (Spain) and the MIB 30 (Italy), in the context of non-stationarity. Our empirical …

2006-07-19abs ↗pdf ↗

In this paper we perform a statistical analysis over the returns and relative prices of the CAC 4040 and the S\&P 500500 with the purpose of analyzing the intra-day seasonalities of single and cross-sectional stock dynamics. In order to do that, we characterized the dynamics of a stock (or a set of stocks) by the evolut…

2015-01-21abs ↗pdf ↗

Study the link between entropy and market efficiency using fractal properties.

problem Determining market efficiency using entropy-based measures and fractal properties.
method Theoretical expression for market information using fractional Brownian motion and Lamperti transform. Multiscale method to interpret entropy and market information.
result A Hurst exponent close to 1/2 can lead to high informativeness of time series due to stationarity.

The majority of recommender systems are designed to recommend items (such as movies and products) to users. We focus on the problem of recommending buyers to sellers which comes with new challenges: (1) constraints on the number of recommendations buyers are part of before they become overwhelmed, (2) constraints on th…

2014-06-02abs ↗pdf ↗

One of the major issues studied in finance that has always intrigued, both scholars and practitioners, and to which no unified theory has yet been discovered, is the reason why prices move over time. Since there are several well-known traditional techniques in the literature to measure stock market volatility, a centra…

2008-09-26abs ↗pdf ↗

Recent studies show that a negative shock in stock prices will generate more volatility than a positive shock of similar magnitude. The aim of this paper is to appraise the hypothesis under which the conditional mean and the conditional variance of stock returns are asymmetric functions of past information. We compare …

2006-07-25abs ↗pdf ↗

Cardiovascular disease (CVD) is the global leading cause of death. A strong risk factor for CVD events is the amount of coronary artery calcium (CAC). To meet demands of the increasing interest in quantification of CAC, i.e. coronary calcium scoring, especially as an unrequested finding for screening and research, auto…

2019-02-12abs ↗pdf ↗

Hybrid LSTM-ARIMA model outperforms other algorithms in algorithmic investment strategies.

problem Developing an optimal algorithmic investment strategy.
method Combines LSTM and ARIMA models, using LSTM for final predictions and ARIMA residuals for boosting.
result LSTM-ARIMA algorithm outperforms all other algorithms across multiple equity indices.

We show that the Snake on a square SC(S1)SC(S^1) is homotopy equivalent to the space AC(S1)AC(S^1) which was investigated in the previous work by Eda, Karimov and Repov\vs. We also introduce related constructions CSC()CSC(-) and CAC()CAC(-) and investigate homotopical differences between these four constructions. Finally, we explici…

2013-05-27abs ↗pdf ↗

Long short-term memory network outperforms seasonal model in JSE Top 40 forecasting.

problem Comparing neural network performance to traditional models in financial forecasting.
method Used long short-term memory network for JSE Top 40 return data forecasting.
result Long short-term memory network outperforms seasonal model in forecasting.

Study on knots formed by Coxeter galleries, finding bounds and symmetric trefoils.

problem Understanding knots created by Coxeter galleries.
method Examined knots in affine Coxeter complex of type \widewedge{B3}, constructing galleries and proving properties.
result Found bounds on stick number and smallest length of symmetric trefoils.

We examine how the structure of the world trade network has been shaped by globalization and recessions over the last 40 years. We show that by treating the world trade network as an evolving system, theory predicts the trade network is more sensitive to evolutionary shocks and recovers more slowly from them now than i…

2010-10-03abs ↗pdf ↗

This paper tackles worst-class error rate in classification tasks.

problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.

RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.

problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.

DIGEN benchmark provides synthetic datasets for ML algorithm evaluation.

problem Understanding and comparing machine learning algorithms' performance.
method Synthetic datasets generated using 40 mathematical functions to evaluate machine learning algorithms.
result DIGEN resource facilitates understanding why algorithms perform poorly and provides ideas for improvement.

Two machine learning models detect anomalies in ER claims, saving up to 40% in improper payments.

problem Improper health insurance payments from fraud and upcoding.
method Two machine learning models: an upcoding model based on severity code distributions and a random forest model for claim sorting.
result Random forest model saved 12% to 40% in improper payments compared to a baseline approach.

Bayesian optimization reduces hyperparameter tuning cost for stochastic models.

problem Hyperparameter tuning under uncertainty in noisy function evaluations.
method Bayesian optimization framework for scale parameter in stochastic models, using statistical surrogate and closed-form optimizer.
result Significant reduction in computational cost (40 times fewer data points, 40-fold reduction in cost).

New methods classify hyperbolic polytopes with up to 40 facets.

problem Classifying compact hyperbolic Coxeter polytopes with specific facet counts.
method New combinatorial method via point set order types.
result Proves existence of a compact hyperbolic Coxeter 29-polytope with at least 40 facets.

The theory of Vassiliev invariants deals with many modules of diagrams on which the algebra Lambda defined by Pierre Vogel acts. By specifying a quadratic simple Lie superalgebra, one obtains a character on Lambda. We show the coherence of these characters by building a map of graded algebras beetwen Lambda and a quoti…

2001-07-19abs ↗pdf ↗

Enhances portfolio performance using deep reinforcement learning and future rewards.

problem Improving existing high-performing portfolio strategies through dynamic rebalancing.
method Proximal Policy Optimization (PPO) and Oracle agents for dynamic rebalancing; Regret-based Sharpe reward function; Transaction cost scheduler; Future-looking reward function; Circular block bootstrap training.
result Significantly enhanced portfolio performance compared to traditional strategies and baselines.

This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossings is obtained. In …

2002-11-22abs ↗pdf ↗

There is an elegant relation found by Fabricius-Bjerre [Math. Scand 40 (1977) 20--24] among the double tangent lines, crossings, inflections points, and cusps of a singular curve in the plane. We give a new generalization to singular curves in RP^2. We note that the quantities in the formula are naturally dual to each …

2006-02-01abs ↗pdf ↗

CSDI improves time series imputation by 40-65% over existing methods.

problem Imputing missing values in time series data.
method Conditional Score-based Diffusion models conditioned on observed data.
result CSDI improves by 40-65% over existing probabilistic imputation methods on popular metrics.

It has been 40 years since Lawson and Osserman introduced the three minimal cones associated with Dirichlet problems in their 1977 Acta paper [LO77]. The first cone was shown area-minimizing by Harvey and Lawson in the celebrated paper [HL82]. In this paper, we confirm that the other two are also area-minimizing. In fa…

2016-10-26abs ↗pdf ↗

XLabel tool reduces medical experts' workload by 40% and explains its decisions.

problem Efficiently labeling large electronic health records.
method Visual-interactive tool using Explainable Boosting Machine (EBM) for classification and explanation.
result EBM achieves high accuracy and explainability, even with mislabeled data.

This study attempts to analyze patterns in cryptocurrency markets using a special type of deep neural networks, namely a convolutional autoencoder. The method extracts the dominant features of market behavior and classifies the 40 studied cryptocurrencies into several classes for twelve 6-month periods starting from 15…

2019-10-27abs ↗pdf ↗

Study compares 29 emulators across 60 test functions and 40 datasets.

problem Comparing the strengths and weaknesses of different emulators.
method Large-scale, fully reproducible comparison using R package duqling.
result Detailed empirical insights into emulator strengths and weaknesses.

We start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced in 2000. We discuss the work on these options and related derivative securities …

2012-09-09abs ↗pdf ↗

The divergence theorem in its usual form applies only to suitably smooth vector fields. For vector fields which are merely piecewise smooth, as is natural at a boundary between regions with different physical properties, one must patch together the divergence theorem applied separately in each region. We give an elegan…

1994-04-02abs ↗pdf ↗

New method clusters strong and weak views effectively, improving performance by up to 40%.

problem Clustering incomplete multi-view data with unbalanced incompleteness.
method View evolution scheme and weighted multi-view subspace clustering.
result Improves clustering performance by up to 40% on three metrics.

Societal bias towards certain communities is a big problem that affects a lot of machine learning systems. This work aims at addressing the racial bias present in many modern gender recognition systems. We learn race invariant representations of human faces with an adversarially trained autoencoder model. We show that …

2019-11-16abs ↗pdf ↗

CollaQ improves multi-agent performance in StarCraft by 40% with fewer samples.

problem Limited generalization and high training rounds in multi-agent reinforcement learning.
method Formulates multi-agent collaboration as joint optimization on reward assignment, decomposes Q-function into self and interactive terms, and uses MARA loss.
result Improves win rate by 40% in StarCraft maps with same number of samples compared to state-of-the-art techniques.