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

5.0%10.0%15.0%20.0% · May 202619922001200920172026
48 results for Selection Mechanism

Proposes PEMI for online selective conformal prediction with asymmetric rules.

problem Challenges of handling asymmetric selection mechanisms in online selective conformal prediction.
method PEMI: permutation-based framework for selective conformal prediction with arbitrary asymmetric selection rules.
result Achieves exact selection-conditional coverage for any asymmetric selection mechanism and any prediction model.

Financial asset markets are sociotechnical systems whose constituent agents are subject to evolutionary pressure as unprofitable agents exit the marketplace and more profitable agents continue to trade assets. Using a population of evolving zero-intelligence agents and a frequent batch auction price-discovery mechanism…

2018-12-13abs ↗pdf ↗

A new mechanism reduces expert belief regret in online forecasting.

problem Minimizing expert belief regret in strategic forecasting.
method Developed a no-regret mechanism for non-myopic experts using online I-ELF.
result Achieved ildeO(TN) ilde{O}(\sqrt{T N}) regret for full-information setting.

A new model shows fairness mechanisms can improve selection utility even without implicit bias.

problem Improving selection fairness without introducing a utility trade-off.
method A model with latent quality and group-dependent variance, comparing fairness mechanisms to group-oblivious selection.
result Demographic parity always increases selection utility, while γγ-rules weakly increase it.

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.

A novel incentive mechanism improves fairness and participation in federated learning.

problem Low-quality clients and lack of fairness in federated learning.
method Client selection process and money transfer mechanism to ensure fairness and participation.
result The proposed incentive mechanism improves the duration and fairness of federated learning.

The paper analyzes 1\ell_1-LinR for Ising model selection using statistical mechanics.

problem Model selection consistency of 1\ell_1-LinR for Ising models.
method Replica method from statistical mechanics, 1\ell_1-regularized linear regression (1\ell_1-LinR).
result Model selection consistency with sample complexity $M=\mathcal{O}\left(\log N ight)$.

FedACS uses attention to select clients with similar data for federated learning.

problem Non-IID data and data scarcity in federated learning.
method FedACS integrates an attention mechanism to prioritize clients with similar data distributions.
result FedACS improves federated learning performance by addressing non-IID data and data scarcity.

A DP method selects best sparse models in high dimensions efficiently.

problem Model selection in high-dimensional sparse linear regression under privacy constraints.
method Differential privacy (DP) with exponential mechanism and Metropolis-Hastings algorithm.
result The method identifies active features quickly under privacy constraints.

LMoE uses LLMs to improve stock trading by selecting experts based on textual and price data.

problem Traditional neural network-based router selection in MoE models is suboptimal and ignores textual data.
method Proposes LLMoE, using LLMs as routers to select experts based on historical price data and stock news.
result LLoM outperforms state-of-the-art MoE models and other deep neural network approaches.

Before retiring, looking back to forty years of writing and publishing scientific papers, I decided to present to the scientific community a selection of my scientific works. I chose mostly articles published in prestigious journals or Proceedings that made a certain impact in the scientific world. I have selected thir…

2012-02-28abs ↗pdf ↗

Validates conformal prediction for network data under non-uniform sampling.

problem Validity of conformal prediction for network data under non-representative sampling.
method Interprets sampling mechanisms as selection rules, studies validity conditional on selection events, uses permutation invariance and joint exchangeability.
result Finite-sample validity of conformal prediction for certain selection events and asymptotic validity for random walk sampling.

In this article, we advocate the ensemble approach for variable selection. We point out that the stochastic mechanism used to generate the variable-selection ensemble (VSE) must be picked with care. We construct a VSE using a stochastic stepwise algorithm, and compare its performance with numerous state-of-the-art algo…

2010-03-30abs ↗pdf ↗

STAS selects optimal spatio-temporal scales for bias correction in precipitation forecasts.

problem Limited prior data and fixed ST scale in existing BCoPs lead to biases in numerical weather predictions.
method End-to-end deep-learning BCoP model STAS with SFM/TFM to automatically adjust spatial and temporal scales.
result STAS outperforms 8 published BCoP methods on threat scores (TS).

A fast, approximate method for variable selection in GLMs tackles correlated data.

problem Variable selection in generalized linear models with correlated data.
method Replica method of statistical mechanics and vector approximate message passing.
result The proposed algorithm provides fast convergence and high approximation accuracy.

Proposes methods to correct bias and missing data in regression models.

problem Nonignorable selection bias and missing response in regression models.
method Imputation-based and importance weighted regression methods, including repeated regression and doubly robust combination.
result Repeated regression can effectively correct bias and outperforms weighted regression in extrapolation.

A game-theoretic approach selects features by testing their marginal contributions.

problem Feature selection in econometric and statistical models.
method A coalitional game where features are players and payoff is model performance. Hypothesis test decides feature relevance.
result The approach significantly outperforms existing methods in simulations.

The study improves the perceptron's storage capacity by optimizing variable selection.

problem Distinguishing genuine structure from random correlations in high-dimensional data.
method Replica method from statistical mechanics for optimal variable selection.
result Optimal variable selection can surpass the Cover--Gardner bound for pattern classification.

Study automates feature selection and clustering for HFT stock price forecasting.

problem Manual feature selection and clustering for high-frequency trading (HFT) stock price forecasting.
method Dual competitive feature importance mechanism and clustering via shallow neural network topology.
result Enhanced forecasting ability of the RBFNN regressor through automated feature selection and clustering.

Although deep neural networks generally have fixed network structures, the concept of dynamic mechanism has drawn more and more attention in recent years. Attention mechanisms compute input-dependent dynamic attention weights for aggregating a sequence of hidden states. Dynamic network configuration in convolutional ne…

2019-12-01abs ↗pdf ↗

We consider a general framework of optimal mechanism design under adverse selection and ambiguity about the type distribution of agents. We prove the existence of optimal mechanisms under minimal assumptions on the contract space and prove that centralized contracting implemented via mechanisms is equivalent to delegat…

2019-10-28abs ↗pdf ↗

An ensemble technique is characterized by the mechanism that generates the components and by the mechanism that combines them. A common way to achieve the consensus is to enable each component to equally participate in the aggregation process. A problem with this approach is that poor components are likely to negativel…

2018-04-17abs ↗pdf ↗

This paper solves optimal market making for multiple goods, including bundling, under adverse selection.

problem Designing optimal market making mechanisms for multiple goods and adverse selection.
method Formulated as an optimal transport problem with geometric constraints, using differentiable economics.
result Optimal market making mechanisms can exploit bundling to improve prices and accept payments in kind.

DMFAW improves multi-view clustering with adaptive weights and feature selection.

problem Lack of effective feature selection and empirical hyperparameter selection in existing deep matrix factorization methods.
method Introduces Deep Matrix Factorization with Adaptive Weights (DMFAW) for multi-view clustering, incorporating feature selection and dynamically updating weights using Control Theory.
result DMFAW outperforms state-of-the-art methods in clustering performance.

Transformers can adaptively select and perform various machine learning tasks in context.

problem Transformers' ability to perform multiple machine learning tasks without explicit prompting.
method Statistical theory and efficient implementation of in-context gradient descent, enabling transformers to implement various algorithms and tasks.
result Transformers can implement a broad class of standard machine learning algorithms in context, including algorithm selection.

New method corrects selection bias in complex models.

problem Selection bias in statistical studies leading to systematic distortions.
method Amortized Bayesian inference with neural posterior estimation.
result Recover well-calibrated posterior distributions across diverse selection mechanisms.

Minimal Morse functions on Poincaré dodecahedral space are selected via spectral properties.

problem Identifying minimal Morse functions on the Poincaré dodecahedral space.
method Spectral selection property P, obstruction principle, conformal variations, finite dimensional reduction.
result Restoration of minimal Morse selection on the Poincaré dodecahedral space via spectral mechanisms.

Benchmarking 18 deep neural network selective classification models on various datasets.

problem Designing a model that can abstain from making predictions when there's high risk of error.
method Evaluation of 18 selective classification models using multiple criteria.
result No single model is the clear winner; best model depends on objectives.

LLMs can be influenced by unseen dataset subtexts, revealing new ways to select data subsets.

problem Understanding how datasets subtly influence LLMs and their properties.
method Logit-Linear-Selection (LLS) method to select subsets of datasets.
result LLS reveals hidden effects in LLMs that persist across different models and architectures.

We show implicit filter level sparsity manifests in convolutional neural networks (CNNs) which employ Batch Normalization and ReLU activation, and are trained with adaptive gradient descent techniques and L2 regularization or weight decay. Through an extensive empirical study (Mehta et al., 2019) we hypothesize the mec…

2019-05-13abs ↗pdf ↗

Study compares variable selection methods for model evaluation and search.

problem Understanding underlying mechanisms in scientific questions through variable selection.
method Comprehensive comparison of BIC and AIC for model evaluation and various search methods (exhaustive, greedy, LASSO path, stochastic search) for model space exploration.
result Exhaustive search BIC and stochastic search BIC outperform other methods in small and large model spaces, respectively, improving correct identification rate and reducing false discovery rate.