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

Trend · papers per month

285583110 · Jun 202019922001200920172026
48 results for M4 competition

New forecasting framework sktime replicates and improves M4 study results.

problem Improving univariate forecasting performance using simple machine learning approaches.
method Designing and implementing a new forecasting API in sktime, using it to replicate and extend M4 study results.
result Simple hybrid and pure approaches can boost statistical model performance and achieve competitive results on hourly data.

We propose a novel parameterized family of Mixed Membership Mallows Models (M4) to account for variability in pairwise comparisons generated by a heterogeneous population of noisy and inconsistent users. M4 models individual preferences as a user-specific probabilistic mixture of shared latent Mallows components. Our k…

2015-04-03abs ↗pdf ↗

Kaggle competitions offer valuable insights for business forecasting.

problem Lack of attention to Kaggle competitions in academic forecasting studies.
method Review of results from six Kaggle competitions featuring real-life business forecasting tasks.
result Global ensemble models outperform local single models in Kaggle competitions.

Due to their prevalence, time series forecasting is crucial in multiple domains. We seek to make state-of-the-art forecasting fast, accessible, and generalizable. ES-RNN is a hybrid between classical state space forecasting models and modern RNNs that achieved a 9.4% sMAPE improvement in the M4 competition. Crucially, …

2019-07-07abs ↗pdf ↗

This paper presents a time series forecasting framework which combines standard forecasting methods and a machine learning model. The inputs to the machine learning model are not lagged values or regular time series features, but instead forecasts produced by standard methods. The machine learning model can be either a…

2020-01-14abs ↗pdf ↗

Feature-based time series representations have attracted substantial attention in a wide range of time series analysis methods. Recently, the use of time series features for forecast model averaging has been an emerging research focus in the forecasting community. Nonetheless, most of the existing approaches depend on …

2019-04-17abs ↗pdf ↗

The authors argue against the classification of forecasting methods as machine learning or statistical.

problem The classification of forecasting methods as machine learning or statistical limits insights into their appropriateness and effectiveness.
method Alternative characteristics of forecasting methods are proposed to draw meaningful conclusions.
result The distinction between machine learning and statistical forecasting methods is not fundamental.

This paper introduces a deep learning ensemble forecasting model using Dirichlet process.

problem Forecasting with deep learning ensemble models.
method Infinite mixture model based on Dirichlet process, with decaying learning rate strategy.
result The ensemble model outperforms single benchmark models in prediction accuracy and stability.

This paper won 1st place in forecasting and investment challenges, improving on meta-learning and parametric models.

problem Forecasting and investment challenges in time-series data.
method Hypernetworks and adversarial portfolios to design time-series models.
result Outperformed state-of-the-art meta-learning methods and conventional parametric models.

Topological attention improves forecasting of univariate time series.

problem Forecasting univariate time series using local topological features.
method Topological attention mechanism that integrates local topological properties into forecasting models.
result Topological attention leads to state-of-the-art performance on the M4 benchmark.

HERMES model predicts nonstationary fashion trends using social media data.

problem Forecasting nonstationary fashion time series for optimal inventory decisions.
method Hybrid model combining parametric models, seasonal components, and recurrent neural networks with external signals.
result State-of-the-art results on fashion dataset and M4 competition time series.

Meta-learning predicts optimal ensemble size and methods for time series forecasting.

problem Finding the best ensemble of time series forecasting methods.
method Two-step approach using meta-learning to predict ensemble size and methods.
result Meta-learning outperformed benchmarks in forecasting errors for all data types and horizons.

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.

Proposes CoPO, a new policy optimization method for competitive games.

problem Designing efficient optimization methods for competitive Markov decision processes.
method Competitive policy optimization (CoPO) approach that exploits game-theoretic nature of competitive games.
result Stable optimization, convergence to sophisticated strategies, and higher scores compared to baseline methods.

The origin of economic crises is a key problem for economics. We present a model of long-run competitive markets to show that the multiplicity of behaviors in an economic system, over a long time scale, emerge as statistical regularities (perfectly competitive markets obey Bose-Einstein statistics and purely monopolist…

2010-10-07abs ↗pdf ↗

New framework promotes reproducible, domain-agnostic reinforcement learning algorithms.

problem Domain-specific, compute-resource-maximizing, and non-reproducible participant solutions in reinforcement learning competitions.
method Submission retraining, domain randomization, desemantization through domain obfuscation, and compute/environment-sample budget limitation.
result Participant submissions are reproducible, non-specific to the competition environment, and sample/resource efficient.

The Affective Behavior Analysis in-the-wild (ABAW) 2020 Competition is the first Competition aiming at automatic analysis of the three main behavior tasks of valence-arousal estimation, basic expression recognition and action unit detection. It is split into three Challenges, each one addressing a respective behavior t…

2020-01-30abs ↗pdf ↗

Study examines machine learning competitions' impact on AI development.

problem Fostering innovation and skill development in AI.
method Analysis of major competition platforms, workflows, and participant demographics.
result MLCs promote collaboration, reproducibility, and continuous innovation in AI.

Bayesian rating system for large competitions improves prediction and efficiency.

problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.

MineRL Competition reduced reinforcement learning sample needs.

problem Sample inefficiency in reinforcement learning.
method Human demonstrations and imitation learning integrated into reinforcement learning algorithms.
result Top solutions used deep reinforcement learning and imitation learning.

This paper evaluates financial competitiveness of Indian real estate companies using entropy method.

problem Improving financial competitiveness of Indian real estate companies in a competitive market.
method Financial competitiveness evaluation index system using key financial ratios and a scoring system.
result Companies with high scores have strong profitability and operational capacity, while those with lower scores struggle with solvency and working capital.

In this paper, the optimal pricing strategy in Avellande-Stoikov's for a monopolistic dealer is extended to a general situation where multiple dealers are present in a competitive market. The dealers' trading intensities, their optimal bid and ask prices and therefore their spreads are derived when the dealers are info…

2015-12-30abs ↗pdf ↗

TailedTS dataset benchmarks heavy-tailed time series forecasting and periodicity quantification.

problem Benchmarking robustness of time series models under heavy-tailed distributions.
method Derived from Wikipedia page views, introduces periodicity quantification and robust loss functions.
result Standard Gaussian models degrade on high-volume page categories, while robust alternatives perform consistently.

The NIPS 2018 Adversarial Vision Challenge is a competition to facilitate measurable progress towards robust machine vision models and more generally applicable adversarial attacks. This document is an updated version of our competition proposal that was accepted in the competition track of 32nd Conference on Neural In…

2018-08-06abs ↗pdf ↗

We introduce an irreversible discrete multiplicative process that undergoes Bose-Einstein condensation as a generic model of competition. New players with different abilities successively join the game and compete for limited resources. A player's future gain is proportional to its ability and its current gain. The the…

2003-03-16abs ↗pdf ↗

Politicians world-wide frequently promise a better life for their citizens. We find that the probability that a country will increase its {\it per capita} GDP ({\it gdp}) rank within a decade follows an exponential distribution with decay constant λ=0.12λ= 0.12. We use the Corruption Perceptions Index (CPI) and the Global …

2012-09-13abs ↗pdf ↗

FLAIR measures LP competitiveness in AMMs, improving LP performance evaluations.

problem LP returns are affected by both market risk and competitive strategies.
method Introduces FLAIR metric to quantify LP competitiveness and assesses its impact on LP returns.
result FLAIR captures dynamic behavior of LPs and differentiates between active provisioning strategies.

A competition increases financial transaction models' robustness against attacks.

problem Neural networks used by banks are vulnerable to adversarial attacks in financial transaction data.
method A novel competition where participants propose attacks and defenses, simulating real-world conditions.
result Participants' strategies and outcomes provide insights into improving financial transaction models' robustness.

This work bridges competitive learning with gradient-based learning for faster feature extraction.

problem Lack of powerful feature extractors in competitive learning methods.
method Introduces gradient-based competitive layers for feature extraction.
result Demonstrates theoretical equivalence and faster convergence of gradient-based competitive layers.