Improved forecasting in daily time series competition using a correlator method.
problem Forecasting daily time series with data leakage issues.
method Ensemble of five statistical forecasting methods and a correlator method.
result The correlator method was responsible for most of the gains over naive forecasting.
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.
Deep learning improves time series forecasting, outperforming other methods.
problem Improving time series forecasting accuracy.
method Deep learning models for time series prediction.
result Deep learning models consistently outperform other methods in forecasting competitions.
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…
We focus on solving the univariate times series point forecasting problem using deep learning. We propose a deep neural architecture based on backward and forward residual links and a very deep stack of fully-connected layers. The architecture has a number of desirable properties, being interpretable, applicable withou…
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.
Recurrent Neural Networks (RNN) have become competitive forecasting methods, as most notably shown in the winning method of the recent M4 competition. However, established statistical models such as ETS and ARIMA gain their popularity not only from their high accuracy, but they are also suitable for non-expert users as…
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, …
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 …
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.
For2For combines forecasts to improve time series forecasting.
problem Improving time series forecasting accuracy.
method Combines standard forecasting methods and machine learning models using forecasts as features.
result Outperforms all submissions in the M4 competition for quarterly series and most monthly series.
Robust forecast framework reduces distribution error by 63%.
problem Accurate distribution forecast for planning decisions.
method Backtest-based bootstrap and adaptive residual selection.
result Reduces Absolute Coverage Error by more than 63%.
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.
The study evaluates forecast risk-adjusted performance using various metrics.
problem Evaluating forecast reliability beyond accuracy.
method Risk-adjusted performance measures (Sharpe, Sortino, Omega ratios) and Edge Ratio.
result Machine learning models often offer attractive risk profiles but not necessarily higher reliability.
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.
Generating forecasts for time series with multiple seasonal cycles is an important use-case for many industries nowadays. Accounting for the multi-seasonal patterns becomes necessary to generate more accurate and meaningful forecasts in these contexts. In this paper, we propose Long Short-Term Memory Multi-Seasonal Net…
Improved cardiac arrhythmia detection in wearable devices with neural networks.
problem Resource constraints in low-power wearable devices for accurate arrhythmia detection.
method Adapted a convolutional-recurrent neural network to a low-power microcontroller, optimizing for precision and memory usage.
result Reduced F1 score from 0.8 to 0.784 in fixed-point precision, with a 195.6KB memory footprint and 33.98MOps/s throughput. 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.
EAST compresses deep ConvNets for tiny memory nodes.
problem Memory constraints in tiny devices for deep ConvNets.
method Encoding-Aware Sparse Training (EAST) with adaptive group pruning and LZ4 weight encoding.
result EAST achieves deep memory compression with lower sparsity and higher accuracy.
Optimizes forecast accuracy and diversity using multi-task deep learning.
problem Forecasting combinations of time series data.
method Multi-task deep learning architecture that selects and combines forecasting models.
result Enhances point forecast accuracy compared to state-of-the-art methods.
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.
New solutions of gravity from branes wrapped on orbifolds.
problem Constructing new AdS2×M4 solutions in gauged supergravity.
method Uplifting to massive type IIA, wrapping D4-D8 branes on orbifolds, using gravitational blocks.
result Entropy of solutions matches extremizing an entropy function.
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…
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 real estate is a pillar industry of China's national economy. Due to changes in policy and market conditions, the real estate companies are facing greater pressures to survive in a competitive environment. They must improve their financial competitiveness. Based on the conceptual framework of financial competitiven…
First ABAW 2020 Competition analyzes affective behavior tasks.
problem Automatic analysis of valence-arousal, basic expressions, and action units in real-world scenarios.
method Provided Aff-Wild2 database, described Challenges, evaluation metrics, and top-performing systems.
result Demonstrated the feasibility of automatic affective behavior analysis in real-world settings.
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.
Paper tackles online optimization with memory and competitive control.
problem Minimizing hitting and switching costs in online optimization problems.
method Optimistic Regularized Online Balanced Descent algorithm.
result Achieves a constant, dimension-free competitive ratio.
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…
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.
Model predicts growth competition on curved surfaces.
problem Growth dynamics of two subsets on Riemannian manifolds.
method Modeling growth rates on spherically symmetric Riemannian manifolds.
result Conditions for bounded or unbounded growth on different manifolds.
Market competition depends on computational complexity, P != NP makes it impossible.
problem Competitive market outcomes require computational intractability.
method Analyzes the computational hardness of collusion detection in markets.
result If P != NP, collusion detection is computationally infeasible, making collusion unstable.
The M5 competition tackles overdispersed retail sales forecasting with GAMLSS.
problem Overdispersed and zero-inflated retail sales data.
method Distributional forecasting using GAMLSS framework.
result GAMLSS provides better probabilistic forecasting for count data.
Model predicts competition between similar products in sales.
problem Predicting cannibalization between similar products in sales.
method Developed a neural network model that computes a 'competitiveness' function based on product features.
result The model outperforms traditional methods in predicting market share.
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…
Data competitions rely on real-time leaderboards to rank competitor entries and stimulate algorithm improvement. While such competitions have become quite popular and prevalent, particularly in supervised learning formats, their implementations by the host are highly variable. Without careful planning, a supervised lea…
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…
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. We use the Corruption Perceptions Index (CPI) and the Global …
We present a broad agenda for meaningful banking regulation reform aiming the creation of evolutive competitive environment to maximize the effectiveness of international financial system through the introduction of fair competition process among the banks in free market capitalism. We assume that the international fin…
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.
Kaggle chronicles 15 years of competitions, innovation, and data science.
problem Exploring 15 years of data science competitions and innovations.
method Longitudinal trend analysis and exploratory data analysis of millions of kernels and discussion threads.
result Kaggle is a growing platform with diverse use cases and adaptable Kagglers.
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.