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

Trend · papers per month

295887116 · Jun 202019922001200920172026
48 results for Exclusive Competition

Paper tackles unfair advantages in DARTS, presenting Fair DARTS to improve neural architecture search.

problem Performance collapse in DARTS due to unfair advantages in skip connections.
method Relax exclusive competition to collaborative, let architectural weights be independent, and use zero-one loss for discretization.
result New state-of-the-art results on CIFAR-10 and ImageNet, demonstrating the effectiveness of Fair DARTS.

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 ↗

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 ↗

We study the dynamics of co-evolution of producers and customers described by bit-strings representing individual traits. Individual ''size-like'' properties are controlled by binary encounters which outcome depends upon a recognition process. Depending upon the parameter set-up, mutual selection of producers and custo…

2007-06-07abs ↗pdf ↗

PieClam autoencodes graphs into communities, improving graph anomaly detection.

problem Graph anomaly detection and universal graph autoencoding.
method Probabilistic graph model with overlapping inclusive and exclusive communities.
result PieClam is a universal autoencoder that uniformly approximates any graph.

Research quantifies financial exclusion risks in UK, focusing on cash infrastructure and socio-economic factors.

problem Localised financial exclusion in the UK as cash infrastructure declines.
method Developed a composite indicator using various input variables.
result Financial exclusion is more prevalent in deprived communities and affluent areas.

Introduces joint exclusivity (JE), a new form of negative dependence.

problem Negative dependence structures in probability distributions.
method Defines JE by exclusion of the interior of the non-negative orthant, establishes necessary and sufficient conditions for existence, proposes a canonical construction.
result Sharp necessary and sufficient condition for existence of JE random vectors with prescribed marginals.

Exclusive Group Lasso improves feature selection in correlated biological data.

problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.

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.

Exclusive Lasso improves survival prediction in cancer datasets.

problem Enhanced survival prediction in cancer datasets with high-dimensional genomic and clinical data.
method Proposes Exclusive Lasso regularization for feature selection in Cox regression models for grouped variables.
result Demonstrates improved survival prediction performance using Exclusive Lasso compared to standard Cox regression.

The paper proposes a model to learn disentangled representations using mutual information.

problem Learning disentangled representations from shared and exclusive attributes.
method Mutual information maximization for shared attributes and minimization for disentanglement.
result The proposed model outperforms state-of-the-art models in representation disentanglement.

An exclusion particle model is considered as a highly simplified model of a limit order market. Its price behavior reproduces the well known crossover from over-diffusion (Hurst exponent H>1/2) to diffusion (H=1/2) when the time horizon is increased, provided that orders are allowed to be canceled. For early times a ma…

2002-06-24abs ↗pdf ↗

Negative screening is one method to avoid interactions with inappropriate entities. For example, financial institutions keep investment exclusion lists of inappropriate firms that have environmental, social, and government (ESG) problems. They create their investment exclusion lists by gathering information from variou…

2018-11-09abs ↗pdf ↗

New study analyzes security of neural network data reconstruction attacks.

problem Data reconstruction attacks pose a threat to private training data.
method Analyzes security boundary of data reconstruction attacks via neuron exclusivity state.
result Characterizes insecure/secure boundary of data reconstruction attacks.

MOVDA improves skill ratings by considering margin of victory deviations.

problem Traditional rating systems discard valuable performance data.
method Margin of Victory Differential Analysis (MOVDA) learns a non-linear function to predict expected MOV and uses the difference between true and expected MOV for rating updates.
result MOVDA significantly outperforms standard ELO and Bayesian baselines in NBA basketball data.

Unsupervised learning is becoming more and more important recently. As one of its key components, the autoencoder (AE) aims to learn a latent feature representation of data which is more robust and discriminative. However, most AE based methods only focus on the reconstruction within the encoder-decoder phase, which ig…

2019-03-30abs ↗pdf ↗

Improved flow-based inference speeds up and boosts accuracy for complex simulations.

problem Challenging inverse problems in astronomy, such as modeling strong gravitational lens systems.
method Refines flow-based generative models with simulator feedback for posterior inference.
result Improves accuracy by 53% and speeds up inference by up to 67x.

Analyzes how inclusion/exclusion from STOXX Europe 600 Index affects company prices.

problem Understanding price dynamics of companies in STOXX Europe 600 Index.
method Used logit models and neural networks to analyze data.
result Identified independent variables affecting price changes.

Study risk-constrained Kelly optimization for mutually exclusive outcomes, proving support invariance and developing a structured algorithm.

problem Risk-constrained Kelly optimization for mutually exclusive outcomes with explicit state prices.
method Analyzes the finite mutually exclusive outcome version of risk-constrained Kelly optimization with explicit state prices, proving support invariance and developing a structured algorithm.
result Support is invariant across CRRA parameter and drawdown-surrogate parameter in the overround regime.

Study of SO(3)-irreducible geometry in complex 5D and ternary Pauli exclusion principle.

problem Exploring SO(3)-irreducible geometry in complex 5D.
method Defined a ternary skew-symmetric tensor, split the 10D space into irreducible SO(3) subspaces, found invariants and defined geometric structures.
result Defined a SO(3)-irreducible geometric structure on a 5D complex Hermitian manifold.

TempoPFN models for zero-shot time series forecasting using synthetic data.

problem Efficient long-horizon prediction and reproducibility in zero-shot time series forecasting.
method Linear RNNs pre-trained on synthetic data with GatedDeltaProduct architecture and state-weaving.
result Achieves top-tier competitive performance on various benchmarks.

In this paper we consider the problem of semi-supervised learning with deep Convolutional Neural Networks (ConvNets). Semi-supervised learning is motivated on the observation that unlabeled data is cheap and can be used to improve the accuracy of classifiers. In this paper we propose an unsupervised regularization term…

2016-06-09abs ↗pdf ↗

Meta-learning improved by using information theory to prioritize data-driven adaptation.

problem Challenges in meta-learning due to the need for mutually-exclusive tasks.
method Designing a meta-regularization objective using information theory.
result Successfully uses data from non-mutually-exclusive tasks to efficiently adapt to novel tasks.

Valid causal inference with invalid instruments using majority or modal valid relationships.

problem Estimating causal effects in the presence of unobserved confounding and invalid instruments.
method Ensemble of instrumental variable estimators to estimate the modal prediction, achieving accurate estimates of conditional average treatment effects.
result Valid causal inference can be achieved with a majority or modal valid instrument-response relationship.

Modeling wind dynamics in Saudi Arabia using deep learning and stochastic PDEs.

problem Accurately modeling spatio-temporal wind patterns in a large, diverse, and understudied region.
method Energy distance-based spatial reduction, sparse stochastic Echo State Network, non-stationary stochastic PDE reconstruction.
result Produces more accurate wind speed and energy forecasts, saving $1 million annually.

Semi-supervised learning is sought for leveraging the unlabelled data when labelled data is difficult or expensive to acquire. Deep generative models (e.g., Variational Autoencoder (VAE)) and semisupervised Generative Adversarial Networks (GANs) have recently shown promising performance in semi-supervised classificatio…

2019-05-07abs ↗pdf ↗

CREAM models enable concept-grounded predictions and interpretability.

problem Designing models that can encode and extend prior knowledge about concept-concept and concept-task relationships.
method Proposes a flexible and efficient framework (CREAMs) that encodes arbitrary CCC-C and CoYC o Y relationships, incorporating a side-channel for incomplete concept sets.
result CREAM models achieve competitive task performance while encouraging concept-grounded predictions, avoiding concept leakage and achieving black-box-level performance.

It is well known that a random vector with given marginal distributions is comonotonic if and only if it has the largest sum with respect to the convex order [ Kaas, Dhaene, Vyncke, Goovaerts, Denuit (2002), A simple geometric proof that comonotonic risks have the convex-largest sum, ASTIN Bulletin 32, 71-80. Cheung (2…

2016-03-17abs ↗pdf ↗

Mapping spaces of supermanifolds are usually thought as exclusively in functorial terms (i.e. trough the Grothendieck functor of points). In this work we provide a geometric description of such mapping spaces in terms of infinite-dimensional super-vector bundles.

2013-04-01abs ↗pdf ↗

Network-based strategy for optimal cryptocurrency portfolios identified.

problem Challenges in predicting cryptocurrency prices in a volatile market.
method Network methods to identify decorrelated cryptocurrencies, Markowitz Portfolio Theory.
result Network-based portfolios outperform benchmarks with high expected returns.

New algorithm tackles multi-player bandit problems with limited access to arms.

problem Limited access to dynamic local subsets of arms in multi-player multi-armed bandit problems.
method Adopted Upper Confidence Bound (UCB) for exploration-exploitation and distributed optimization for collisions.
result Proposes a decentralized algorithm with near-optimal regret guarantee.

This paper is a next step in the project of systematic description of colored knot and link invariants started in previous papers. In this paper, we managed to explicitly find the inclusive Racah matrices, i.e. the whole set of mixing matrices in channels R1R2R3QR_1\otimes R_2\otimes R_3\longrightarrow Q with all possible $…

2018-01-29abs ↗pdf ↗

We derive valuations of a portfolio of financial instruments from a securities lending perspective, under different assumptions, and show a weighting scheme that converges to the true valuation. We illustrate conditions under which our alternative weighting scheme converges faster to the true valuation when compared to…

2016-03-03abs ↗pdf ↗