EvoMSA unifies multilingual sentiment analysis systems.
problem Multilingual sentiment analysis in various languages.
method Genetic Programming-based classifier combining multiple text classifiers.
result EvoMSA performs competitively in multiple sentiment analysis competitions.
Study uses Open Banking data to estimate customer value, showing potential 21% increase.
problem Limited CLV estimation using single-entity data.
method Introduces PCLV framework using Open Banking data for comprehensive customer value estimation.
result Open Banking data can estimate PCLV per competitor, showing a 21.06% increase over Actual CLV.
This paper presents an open-source enforcement learning toolkit named CytonRL (https://github.com/arthurxlw/cytonRL). The toolkit implements four recent advanced deep Q-learning algorithms from scratch using C++ and NVIDIA's GPU-accelerated libraries. The code is simple and elegant, owing to an open-source general-purp…
Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.
problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.
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.
Study predicts customer data sharing in Open Banking and explains key factors.
problem Predicting and explaining customer data sharing in Open Banking environments.
method Hybrid data balancing strategy with ADASYN and NEARMISS, XGBoost models, SHAP, CART.
result 91.39% accuracy for inflow and 91.53% for outflow predictions, revealing influential features.
We study a continuous-time version of the intermediation model of Grossman and Miller (1988). To wit, we solve for the competitive equilibrium prices at which liquidity takers' demands are absorbed by dealers with quadratic inventory costs, who can in turn gradually transfer these positions to an exogenous open market …
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.
RNNs are competitive but not as user-friendly as ETS and ARIMA.
problem Improving RNNs for non-expert users.
method Empirical study and open-source framework of RNN architectures.
result RNNs can model seasonality directly if the series have homogeneous patterns.
ICLR 2021 challenge in computational geometry and topology attracted 16 teams.
problem Designing and evaluating computational methods in differential geometry and topology.
method Designing and hosting an open-source competition with repositories Geomstats and Giotto-TDA.
result 16 teams participated in the challenge, showcasing innovative contributions to computational geometry and topology.
Paper uses machine learning to evaluate financial simulations.
problem Quantify the realism of simulated financial time series.
method Machine learning classification of simulated vs real financial data.
result Improved simulation methods through competition results.
ICP separates and competes feature representations to learn diverse information.
problem Learning representations with diversified information.
method Information Competing Process (ICP) separates representations into parts with different mutual information constraints, forcing them to learn independently in a competitive environment.
result ICP facilitates obtaining diversified representations with rich information.
Combining causality, control, and reinforcement learning for system control.
problem Learning to control dynamical systems using causal, control, and reinforcement learning approaches.
method Combining causal identification, control strategies, and reinforcement learning to control dynamical systems.
result Combining different learning paradigms for effective system control.
New method for evaluating LLMs reduces bias in open-ended evaluations.
problem Bias in Elo-based ratings of LLMs due to data redundancies.
method Proposes evaluation as a 3-player game and introduces novel solution concepts.
result Novel method leads to more robust and intuitive ratings.
We present three case studies of organizations using a data science competition to answer a pressing question. The first is in education where a nonprofit that creates smart school budgets wanted to automatically tag budget line items. The second is in public health, where a low-cost, nonprofit women's health care prov…
Few-shot image classification is improved by correcting CNNs' texture bias.
problem Few-shot image classification performance is hindered by CNNs' texture bias.
method Corrected CNNs' texture bias using a simpler method than state-of-the-art approaches.
result State-of-the-art performance on miniImageNet task achieved.
New algorithms prove self-play can be effective in competitive RL.
problem Proving self-play algorithms' effectiveness in competitive reinforcement learning.
method Introduced Value Iteration with Upper/Lower Confidence Bound (VI-ULCB) and explore-then-exploit algorithms.
result Achieved regret bounds of i l d e O ( T ) ilde{\mathcal{O}}(\sqrt{T}) i l d e O ( T ) and i l d e O ( T 2 / 3 ) ilde{\mathcal{O}}(T^{2/3}) i l d e O ( T 2/3 ) . Paper introduces a specialized text classification system for French Open Banking transactions.
problem Classifying specialized banking text data with high accuracy and efficiency.
method Data collection, labeling, preprocessing, modeling, and evaluation stages with language-specific techniques.
result Enhanced performance and efficiency compared to generic approaches.
MAT uses attention mechanism for molecule property prediction.
problem Designing a competitive neural network for molecule property prediction.
method Augmented attention mechanism using inter-atomic distances and molecular graph structure.
result MAT achieves state-of-the-art performance on diverse molecular prediction tasks.
Framework for multi-agent RL with human feedback in a Snake game.
problem Improving multi-agent reinforcement learning with human feedback.
method Developed a simulated game environment for offline model training and online competitions. Introduced HILL methods and reward manipulation heuristics.
result Agents with HILL methods outperform those without in online competitions.
New methods for skill rating in sports using state-space models.
problem Improving skill rating in competitive sports.
method State-space models, sequential Monte Carlo, discrete hidden Markov models.
result Advantages of state-space models for time-varying player skills.
ContestTrade uses competitive teams to improve LLM trading performance.
problem High sensitivity to market noise in LLM-based trading systems.
method Internal competitive mechanism, data and research teams, real-time evaluation.
result Significantly outperforms other systems across various metrics.
Two strategic agents track their portfolios, influencing each other's trading targets.
problem Strategic competition in portfolio tracking with price impact.
method Stochastic linear quadratic differential game with terminal state constraints.
result Unique open-loop Nash equilibrium strategies emerge based on price impact types.
Multi-step ahead forecasting is still an open challenge in time series forecasting. Several approaches that deal with this complex problem have been proposed in the literature but an extensive comparison on a large number of tasks is still missing. This paper aims to fill this gap by reviewing existing strategies for m…
m-arcsinh improves SVM and MLP reliability and speed in scikit-learn.
problem Improving SVM and MLP reliability and speed in scikit-learn.
method Modified arcsinh function for kernel and activation in SVM and MLP.
result Competitive classification performance and reliability of SVM and MLP with m-arcsinh.
ModHiFi identifies critical components for model modification without gradients or loss function.
problem Modifying open weight models without access to training data or loss function.
method Theoretical analysis of Lipschitz-continuous networks, Subset Fidelity metric, and ModHiFi algorithm.
result ModHiFi-P and ModHiFi-U achieve significant performance improvements in model pruning and unlearning.
WILD-SCAV benchmarks AI in complex 3D FPS environments.
problem Lack of complexity and diversity in RL environments.
method Developed a 3D open-world FPS game environment.
result Demonstrates effectiveness in benchmarking RL algorithms.
Classification tasks usually assume that all possible classes are present during the training phase. This is restrictive if the algorithm is used over a long time and possibly encounters samples from unknown classes. The recently introduced extreme value machine, a classifier motivated by extreme value theory, addresse…
L0Learn solves sparse learning problems with millions of features.
problem Sparse learning problems with millions of features.
method Approximate algorithms based on coordinate descent and local combinatorial optimization.
result Achieves competitive run times and statistical performance.
Study examines European banks' digital transformation strategies.
problem Lack of a common framework for open banking innovation in banking sector.
method Qualitative analysis of partnerships and API development.
result European banks are diversifying and boosting customer relationship management.
Scoping review and benchmarking of synthetic EHR data generation methods.
problem Creating realistic synthetic electronic health records for research and training.
method Conducted a scoping review and benchmarked seven methods on open-source EHR datasets.
result GAN-based methods excel in fidelity and utility, while rule-based methods excel in privacy protection.
Cardea automates machine learning for EHRs, improving model building efficiency.
problem Lack of a trusted, open-source framework for automated machine learning in EHRs.
method Uses FHIR for data structure, AUTOML frameworks for feature engineering, model selection, and tuning, and an adaptive data assembler.
result Demonstrates framework's effectiveness on 5 prediction tasks, highlighting its flexibility and human competitiveness.
Method quantifies relation similarity using entity pair distributions.
problem Measuring similarity between relations in knowledge bases.
method Simple neural network parameterizes conditional probability distributions over entity pairs. Sampling-based approximation for similarity computation.
result Approximation correlates with human judgments and detects redundant relations.
Study shows how multiple traders can trade together without excessive price impact.
problem Coordination issues in trading to exploit a common signal.
method Closed-loop Nash competition model for stochastic differential games.
result Excessive trading reduced but not significantly for practical parameters.
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…
CAT is a new ASR toolkit using CRF and CTC for state-of-the-art speech recognition.
problem Improving automatic speech recognition systems.
method CRF-based discriminative training with CTC-inspired state topology.
result CAT achieves state-of-the-art results with fewer parameters and is competitive with hybrid models.
We propose NetGAN - the first implicit generative model for graphs able to mimic real-world networks. We pose the problem of graph generation as learning the distribution of biased random walks over the input graph. The proposed model is based on a stochastic neural network that generates discrete output samples and is…
msPCA solves sparse PCA for multiple components efficiently.
problem Sparse principal component analysis with multiple components.
method Alternating maximization algorithm for sparse loading vectors, with orthogonality or zero correlation constraints.
result Achieves high variance explained with sparse components and controlled feasibility violations.
Language models can answer questions without external knowledge.
problem How much knowledge can be stored in language models?
method Fine-tuning pre-trained language models to answer questions without external context.
result Fine-tuned models perform competitively with open-domain systems.
Reinforcement learning improves insurance claims reserving by learning from all claim trajectories.
problem Traditional reserving models learn only from settled claims, missing valuable data from ongoing claims.
method Formulated as a Markov decision process, uses reinforcement learning to update OCL estimates sequentially.
result Soft Actor-Critic implementation achieves competitive claim-level accuracy and strong aggregate performance.
TorchKM: A GPU-Oriented Library for Kernel Learning and Model Selection
problem Kernel learning and model selection
method GPU acceleration
result Competitive predictive performance with speedups
The paper analyzes strategic irreversible investments with novel dynamic strategies.
problem Tradeoff between preemption incentives and option value of waiting in oligopolistic markets.
method Developed novel Markov perfect equilibrium to handle singular control of optimal investment.
result Simpler strategies lead to a 'preemption trap' with zero net present values.
Method explains machine learning diabetes risk predictions.
problem Lack of interpretability in machine learning models.
method Automatic explanation method for machine learning models.
result 87.4% of patients' predictions explained without accuracy loss.
Paper tackles uncertainty prediction for deep sequential regression.
problem Challenges in generating accurate uncertainty estimates for deep recurrent networks.
method Flexible method that generates symmetric and asymmetric uncertainty estimates without stationarity assumptions.
result Outperforms competitive baselines on both drift and non-drift scenarios.
This master thesis focuses on practical application of Convolutional Neural Network models on the task of road labeling with bike attractivity score. We start with an abstraction of real world locations into nodes and scored edges in partially annotated dataset. We enhance information available about each edge with pho…
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.
New model creates code semantics vectors for better understanding.
problem Improving code understanding and embedding quality.
method Siamese recurrent neural network on Python source code.
result Model significantly outperforms bag-of-tokens embeddings.
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.