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

4008011,2011,601 · Jun 202019922001200920172026
48 results for machine learning competitions

In this paper, we propose AutoCompete, a highly automated machine learning framework for tackling machine learning competitions. This framework has been learned by us, validated and improved over a period of more than two years by participating in online machine learning competitions. It aims at minimizing human interf…

2015-07-08abs ↗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.

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.

State-space models win a forecasting competition for unstable data.

problem Forecasting electricity demand during the post-covid period.
method Adapting state-space models to balance time-series adaptability and machine learning complexity.
result State-space models provide a better compromise between adaptability and accuracy for non-stationary data.

LLMs can collude in market divisions, maximizing profits.

problem Strategic collusion of LLM agents in multi-commodity markets.
method Examined LLMs in Cournot competition frameworks, analyzing pricing and resource allocation strategies.
result LLMs can monopolize specific commodities without direct human input or explicit collusion commands.

Study shows competition feedback can make ML predictors biased towards specific user groups.

problem How competition affects machine learning predictors and user prediction quality.
method Flexible model of competing ML predictors, empirical and mathematical analysis.
result Competition causes predictors to specialize for specific sub-populations at the cost of general performance.

To accelerate research on adversarial examples and robustness of machine learning classifiers, Google Brain organized a NIPS 2017 competition that encouraged researchers to develop new methods to generate adversarial examples as well as to develop new ways to defend against them. In this chapter, we describe the struct…

2018-03-31abs ↗pdf ↗

The boom of deep learning induced many industries and academies to introduce machine learning based approaches into their concern, competitively. However, existing machine learning frameworks are limited to sufficiently fulfill the collaboration and management for both data and models. We proposed NSML, a machine learn…

2018-10-08abs ↗pdf ↗

We organized a competition on Autonomous Lifelong Machine Learning with Drift that was part of the competition program of NeurIPS 2018. This data driven competition asked participants to develop computer programs capable of solving supervised learning problems where the i.i.d. assumption did not hold. Large data sets w…

2019-03-12abs ↗pdf ↗

New machine learning pipeline solves dynamic vehicle routing problems efficiently.

problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.

Machine learning for ASD diagnosis using morphological MRI networks.

problem Challenging to diagnose ASD using MRI due to heterogeneity and incomplete network neuroscience.
method Crowdsourced Kaggle competition to develop and benchmark ML pipelines.
result First-ranked team achieved 70% accuracy, 72.5% sensitivity, and 67.5% specificity.

Simple machine learning models outperform deep learning for sleep scoring.

problem Limited applicability and lack of interpretability of deep learning solutions for sleep scoring.
method Revisited sleep stage classification using classical machine learning, including preprocessing, feature extraction, and simple machine learning models.
result Competitive performance achieved with conventional machine learning models on public datasets.

ML4CO uses machine learning to improve combinatorial optimization solvers.

problem Solving combinatorial problems in practice often involves related data distributions.
method Replacing heuristic components with machine learning approaches.
result Improved state-of-the-art combinatorial optimization solvers.

Recent machine learning algorithms dedicated to solving semi-linear PDEs are improved by using different neural network architectures and different parameterizations. These algorithms are compared to a new one that solves a fixed point problem by using deep learning techniques. This new algorithm appears to be competit…

2018-09-20abs ↗pdf ↗

Improved model accuracy can reduce overall user accuracy in competitive markets.

problem The impact of model competition on overall user accuracy.
method Defined a model of competition for classification tasks and used data representations to study the effect of scale.
result Improving data representation quality can decrease overall predictive accuracy across users (social welfare) in a competitive market.

MLI is an Application Programming Interface designed to address the challenges of building Machine Learn- ing algorithms in a distributed setting based on data-centric computing. Its primary goal is to simplify the development of high-performance, scalable, distributed algorithms. Our initial results show that, relativ…

2013-10-21abs ↗pdf ↗

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 ↗

In this paper we study the problem of acoustic scene classification, i.e., categorization of audio sequences into mutually exclusive classes based on their spectral content. We describe the methods and results discovered during a competition organized in the context of a graduate machine learning course; both by the st…

2018-08-02abs ↗pdf ↗

SigD2 reduces noisy rules in rule-based classifiers for better accuracy and readability.

problem Redundant and noisy rules in rule-based classifiers reduce model accuracy and readability.
method Two-stage pruning strategy and ensemble methods (bagging and boosting) to reduce noise and improve model performance.
result SigD2 and ACboost ensemble models outperform state-of-the-art classifiers in terms of accuracy and rule count.

Random Forests provide interpretable prediction intervals with theoretical guarantees.

problem Lack of uncertainty estimates in machine learning point predictions.
method Out-of-Bag procedure for generating parametric and non-parametric prediction intervals.
result Proposed prediction intervals deliver correct coverage rates and narrow lengths.

A new stock selection strategy uses combined machine learning with dynamic weighting methods.

problem Improving stock selection accuracy and performance.
method Combined machine learning algorithms with static and dynamic weighting methods.
result IC-based dynamic weighting outperforms static evaluation metrics in backtested returns and predictive performance.

Text classification on drug SMILES strings yields competitive drug type classification results.

problem Classifying drug types using conventional text classification methods.
method Treated drug SMILES as sentences and applied basic NLP methods for classification.
result Competitive drug type classification results achieved.

We investigate coresets - succinct, small summaries of large data sets - so that solutions found on the summary are provably competitive with solution found on the full data set. We provide an overview over the state-of-the-art in coreset construction for machine learning. In Section 2, we present both the intuition be…

2017-03-19abs ↗pdf ↗

We present two new statistical machine learning methods designed to learn on fully homomorphic encrypted (FHE) data. The introduction of FHE schemes following Gentry (2009) opens up the prospect of privacy preserving statistical machine learning analysis and modelling of encrypted data without compromising security con…

2015-08-27abs ↗pdf ↗

Bayesian optimization outperformed random search in machine learning hyperparameter tuning challenge.

problem Optimizing hyperparameters of machine learning models using derivative-free methods.
method Bayesian optimization vs. random search on real datasets.
result Bayesian optimization significantly outperformed random search in held-out objective functions.

Professional sports are developing towards increasingly scientific training methods with increasing amounts of data being collected from laboratory tests, training sessions and competitions. In cycling, it is standard to equip bicycles with small computers recording data from sensors such as power-meters, in addition t…

2018-08-01abs ↗pdf ↗

Maximal correlation framework improves fairness in machine learning algorithms.

problem Ensuring fairness in machine learning algorithms.
method Introducing maximal correlation framework for fairness constraints and deriving regularizers.
result The approach provides smooth performance-fairness tradeoff curves and competitive performance.

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 ↗

This paper proposes RDS to improve model diversity in data sampling.

problem Data selection process can lead to performance issues in machine learning models.
method Formulates optimisation problem for model diversification, introduces diverse base learners and ensemble reward mechanisms.
result RDS method enhances model performance on various datasets.

The paper proposes blending gradient boosted trees and neural networks for hierarchical time series forecasting.

problem Point and probabilistic forecasting of hierarchical time series.
method A blending methodology of gradient boosted trees and neural networks, with feature engineering and diverse model selection.
result Ranked within the gold medal range in both Accuracy and Uncertainty tracks of the M5 Competition.