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

Trend · papers per month

2525037551,006 · Jun 202019922001200920172026
48 results for competitive networks

Indirect competition emerged from the complex organization of human societies, and knowledge of the existing network topology may aid in developing effective strategies for success. Here, we propose an agent-based model of competition with systems co-existing in a `small-world' social network. We show that within the r…

2008-07-19abs ↗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.

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.

New algorithm for competing influence spread in unknown networks.

problem Maximizing influence spread in a social network with unknown probabilities.
method Combinatorial multi-armed bandit (CMAB) framework, Triggering Probability Modulated (TPM) condition, OCIM-TS, OCIM-OFU, OCIM-ETC.
result Sublinear Bayesian and frequentist regret for OCIM-TS and OCIM-OFU, respectively.

Paper studies competitive networks where teams aim to minimize their own objectives, adapting to each other's strategies.

problem Competitive networks where teams have conflicting objectives.
method Proposes diffusion learning algorithms for two classes of network games: zero-sum and non-zero-sum.
result Stability performance of proposed algorithms analyzed and demonstrated through experiments.

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 tackles representation learning by introducing stochastic competition-based activations.

problem Learning diversified representations in deep learning models.
method Combining information-theoretic arguments with stochastic competition-based activations, using Stochastic Local Winner-Takes-All (LWTA) units.
result The proposed method yields significant discriminative representation learning abilities and allows for a principled investigation of intermediate network representations.

We propose a simple dynamical model of the formation of production networks among monopolistically competitive firms. The model subsumes the standard general equilibrium approach à la Arrow-Debreu but displays a wide set of potential dynamic behaviors. It robustly reproduces key stylized facts of firms' demographics. O…

2015-09-03abs ↗pdf ↗

Combines gradient-based and competitive learning for unsupervised feature extraction.

problem Handling input data without supervision and replicating input manifold topology.
method Integrates gradient-based and competitive learning approaches to learn topological structures.
result The dual competitive layer outperforms the vanilla layer in high-dimensional datasets.

GNNRank uses neural networks to learn global rankings from competition match data.

problem Learning global rankings from pairwise comparisons in directed graphs.
method Proposes GNNRank, a trainable GNN-based framework with digraph embedding and new objectives.
result GNNRank achieves competitive and superior performance compared to baselines.

AlgoPerf competition evaluates neural network training speed-ups.

problem Improving neural network training speed using better algorithms.
method Compared 18 diverse submissions from 10 teams on multiple workloads.
result Schedule Free AdamW algorithm achieved best results in self-tuning ruleset.

Deep network learns Obstacle Tower challenge without human demonstrations.

problem Master procedurally generated levels that get progressively harder.
method Deep Reinforcement Learning with a simple feed-forward network.
result Performed competitively in a reinforcement learning competition.

Presented are two neural network architectures for convex functions, demonstrating competitive performance.

problem Approximating convex functions efficiently and accurately.
method Developed two neural network architectures: one based on linear-by-part representation and the other on cubic splines.
result Cubic ICKAN networks produce results similar to classical ICNNs in solving convex approximation problems.

FDN improves probabilistic regressors' adaptability to distribution shifts.

problem Overconfidence in modern probabilistic regressors under distribution shift.
method FDN uses input-conditioned distributions over network weights, trained with a Monte Carlo beta-ELBO objective.
result FDN produces predictive mixtures whose dispersion adapts to the input, providing shift-aware uncertainty.

This paper uses NARX neural networks for macroeconomic forecasting and goal setting.

problem Improving accuracy in macroeconomic forecasting and goal setting.
method Literature review and construction of specific NARX neural networks for macroeconomic indicators.
result NARX neural networks can be trained to make accurate predictions for macroeconomic indicators and national goals.

We propose a new way of constructing invertible neural networks by combining simple building blocks with a novel set of composition rules. This leads to a rich set of invertible architectures, including those similar to ResNets. Inversion is achieved with a locally convergent iterative procedure that is parallelizable …

2019-07-18abs ↗pdf ↗

Scattering networks are a class of designed Convolutional Neural Networks (CNNs) with fixed weights. We argue they can serve as generic representations for modelling images. In particular, by working in scattering space, we achieve competitive results both for supervised and unsupervised learning tasks, while making pr…

2018-09-17abs ↗pdf ↗

This work makes vision networks more interpretable by identifying key neurons.

problem Complex deep networks are hard to interpret, hindering safety-critical applications.
method Uses stochastic local competition and multimodal models to dissect and interpret neurons.
result The method generates understandable descriptions for a few active neurons, revealing network decision-making.

Paper proposes combining GAM and DNN for accurate peak demand estimation from lower-resolution data.

problem Predicting high-resolution peak demand from limited lower-resolution data.
method Combines generalized additive models (GAM) and deep neural networks (DNN) for half-hourly load forecasting.
result Proposed method reduces out-of-sample RMSE by 57.4% compared to benchmark.

Researchers improved Minecraft game performance using imitation learning.

problem Achieving state-of-the-art performance in immersive environments like Minecraft.
method Applied imitation learning to Minecraft, optimizing network architecture, loss function, and data augmentation.
result Reported stronger results than previous experiments, reaching second place in a competition.

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 ↗

The aim of this work is to enable inference of deep networks that retain high accuracy for the least possible model complexity, with the latter deduced from the data during inference. To this end, we revisit deep networks that comprise competing linear units, as opposed to nonlinear units that do not entail any form of…

2018-05-19abs ↗pdf ↗

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.

HMCNAS generates competitive neural architectures without human-defined parameters.

problem Lack of human-defined parameters in Neural Architecture Search.
method Combines Hidden Markov Chains and Bayesian Optimization for autonomous search space generation and competitive model generation.
result HMCNAS generates competitive models in a short time without human-defined parameters.

This paper demonstrates dynamic hyper-parameter setting, for deep neural network training, using Mutual Information (MI). The specific hyper-parameter studied in this paper is the learning rate. MI between the output layer and true outcomes is used to dynamically set the learning rate of the network through the trainin…

2018-05-18abs ↗pdf ↗

User smeznar achieved 8th place in PGDL by predicting generalization of deep learning models.

problem Understanding and predicting generalization in deep learning models.
method Creating simple metrics and finding their best combination for automatic testing on a dataset.
result Combination of various properties of neural network architectures can be used for generalization prediction.

Gradient-free method improves predictive accuracy for probabilistic models.

problem Balancing computational efficiency and robust predictive performance in deep learning.
method CAVI-CMN, a gradient-free variational method for conditional mixture networks.
result CAVI-CMN achieves competitive and often superior predictive accuracy compared to MLE with backpropagation.

The design of neural network architectures for a new data set is a laborious task which requires human deep learning expertise. In order to make deep learning available for a broader audience, automated methods for finding a neural network architecture are vital. Recently proposed methods can already achieve human expe…

2017-12-20abs ↗pdf ↗

Study copyright's impact on creative industries using AI-generated fonts.

problem Estimating supply and demand in creative industries with AI-generated content.
method Neural network embeddings, spatial regression, event-study analyses, structural model of supply and demand.
result Copyright can raise consumer welfare by encouraging product relocation.

New model improves deep learning robustness against adversarial attacks.

problem Improving adversarial robustness of deep learning models.
method Local competition principle, LWTA nonlinearities, Bayesian non-parametrics.
result The new model achieves high robustness to adversarial perturbations on MNIST and CIFAR10 datasets.

Study cooperative bandit learning with imperfect communication, achieving near-optimal performance.

problem Real-world distributed decision-making with imperfect communication.
method Proposed decentralized algorithms for three communication scenarios: stochastic networks, random delays, and adversarially corrupted rewards.
result Achieved competitive performance and near-optimal guarantees on group regret.

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.

Bayesian optimization is an effective methodology for the global optimization of functions with expensive evaluations. It relies on querying a distribution over functions defined by a relatively cheap surrogate model. An accurate model for this distribution over functions is critical to the effectiveness of the approac…

2015-02-19abs ↗pdf ↗

This work explores maximum likelihood optimization of neural networks through hypernetworks. A hypernetwork initializes the weights of another network, which in turn can be employed for typical functional tasks such as regression and classification. We optimize hypernetworks to directly maximize the conditional likelih…

2017-12-04abs ↗pdf ↗

Deep learning detects bid-rigging cartels with high accuracy.

problem Detecting bid-rigging cartels using pairwise bidding interactions.
method Convolutional neural networks applied to graphs of normalized bid values.
result Convolutional neural networks achieve around 90% accuracy in classifying collusive and competitive bidding interactions.