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

3847681,1511,535 · Jun 202019922001200920172026
48 results for Feature allocation models

Developed a Particle-Gibbs sampler for Bayesian feature allocation models.

problem Intractable exact inference in Bayesian feature allocation models.
method Particle-Gibbs sampler for feature allocation matrix updates.
result PG sampler improves performance of feature allocation models.

New model allocates features sublinearly, improving model fit and performance.

problem Linear growth of shared features limits model flexibility and performance.
method Developed non-exchangeable feature allocation models with sublinear feature sharing.
result Sublinear feature sharing leads to better model fit and predictive performance.

Proposes a flexible feature allocation model for sparse factor analysis.

problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.

We characterize the class of exchangeable feature allocations assigning probability Vn,kl=1kWmlUnmlV_{n,k}\prod_{l=1}^{k}W_{m_{l}}U_{n-m_{l}} to a feature allocation of nn individuals, displaying kk features with counts (m1,,mk)(m_{1},\ldots,m_{k}) for these features. Each element of this class is parametrized by a countable matrix VV

2016-07-07abs ↗pdf ↗

We study classification problems where features are corrupted by noise and where the magnitude of the noise in each feature is influenced by the resources allocated to its acquisition. This is the case, for example, when multiple sensors share a common resource (power, bandwidth, attention, etc.). We develop a method f…

2016-07-10abs ↗pdf ↗

Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is diffuse and it is hard to interpret the sampled partitionings. In this paper, we…

2013-10-01abs ↗pdf ↗

Paper proposes integrating wavelet transform, channel attention, and LSTM for better stock price prediction.

problem Inherently difficult stock price prediction due to low signal-to-noise ratio.
method Wavelet transform convolution, channel attention, and LSTM integration.
result Robust performance in post-pandemic market conditions.

Uber optimizes marketplace levers using machine learning to improve resource allocation efficiency.

problem Optimizing budget allocation for drivers and riders to maximize business value.
method End-to-end machine learning and optimization procedure using feature store, model training, and ADMM.
result Substantially improved Uber's resource allocation efficiency through high-dimensional optimization.

Paper learns data-driven organ matching rules from observational data.

problem Tackles organ transplantation compatibility using observational data.
method Representation learning to cluster donors and apply recipient transformations.
result Model outperforms human experts in predicting transplant outcomes.

Enhances portfolio construction with tailored regime forecasts for individual assets.

problem Traditional portfolio construction methods fail to account for asset-specific market conditions.
method Hybrid framework combining unsupervised and supervised learning for regime identification and forecasting.
result Outperforms traditional portfolio models across various asset classes.

We investigate a class of feature allocation models that generalize the Indian buffet process and are parameterized by Gibbs-type random measures. Two existing classes are contained as special cases: the original two-parameter Indian buffet process, corresponding to the Dirichlet process, and the stable (or three-param…

2015-12-08abs ↗pdf ↗

We present a consensus Monte Carlo algorithm that scales existing Bayesian nonparametric models for clustering and feature allocation to big data. The algorithm is valid for any prior on random subsets such as partitions and latent feature allocation, under essentially any sampling model. Motivated by three case studie…

2019-06-28abs ↗pdf ↗

We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization problem, called the system problem, to find the optimal lottery allocation. The …

2018-12-03abs ↗pdf ↗

A novel federated learning framework resolves structural misalignment in model fusion.

problem Structural misalignment in model fusion due to chaotic information distribution.
method Feature-oriented regulation method (ΨΨ-Net) to ensure feature information allocation and dedicated collaboration schemes.
result Effective enhancement of federated learning applicability to heterogeneous settings with improved convergence speed, accuracy, and efficiency.

This paper explains CART random forests using stochastic control theory.

problem Understanding the inner workings of CART random forests.
method Developed a stochastic-control perspective on CART random forests, interpreting feature subsampling as a random feasible action set and the split rule as a policy.
result Established that the CART policy is locally stabilizing but globally suboptimal for the forest objective.

The paper addresses risk sharing and variability measures among agents with general risk preferences.

problem Risk sharing and variability measures among agents with general risk preferences.
method Characterizes Pareto-optimal allocations using Gini deviation, mean-median deviation, and inter-quantile difference as variability measures.
result Optimal allocations are not comonotonic and feature a mixture of pairwise counter-monotonic structures.

We advocate the use of Agnostic Allocation for the construction of long-only portfolios of stocks. We show that Agnostic Allocation Portfolios (AAPs) are a special member of a family of risk-based portfolios that are able to mitigate certain extreme features (excess concentration, high turnover, strong exposure to low-…

2019-06-12abs ↗pdf ↗

This paper studies robust payoff allocation in submodular games, especially against replication.

problem Payoff allocation in submodular games, especially robustness against replication.
method Systematically studied replication manipulation in submodular games, introduced replication robustness metric, and validated with empirical ML data market.
result Conditions characterizing robustness of semivalues in submodular games.

Optimizes trade execution with reinforcement learning for limit orders.

problem Maximizing revenue in a limit order book with market and limit orders.
method Formulated as a dynamic allocation task, uses multivariate logistic-normal distributions for efficient training.
result Outperforms traditional strategies in simulated environments.

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.

Paper explores alternative cooperative game theory methods for machine learning feature attribution.

problem Debate over Shapley values' relevance in feature attribution.
method Introduces Weber and Harsanyi sets as alternative allocation schemes.
result Provides a coherent framework for designing robust feature attributions.

Federated Machine Learning (FML) creates an ecosystem for multiple parties to collaborate on building models while protecting data privacy for the participants. A measure of the contribution for each party in FML enables fair credits allocation. In this paper we develop simple but powerful techniques to fairly calculat…

2019-09-17abs ↗pdf ↗

The article uses dynamic factor allocation to improve portfolio performance by integrating regime-switching signals.

problem Improving portfolio performance through dynamic factor allocation.
method The authors apply the sparse jump model (SJM) to identify bull and bear market regimes for individual factors, then fine-tune hyperparameters using a hypothetical single-factor long-short strategy. These regime inferences are incorporated into the Black-Litterman framework to dynamically adjust allocations among indices.
result The constructed multi-factor portfolio significantly improves the information ratio (IR) relative to the market, raising it from 0.05 to approximately 0.4.

New pricing framework allocates costs of operating reserves and transmission.

problem Allocating costs of operating reserves and transmission efficiently.
method Causation-based framework using contingency-constrained scheduling models.
result More comprehensive and efficient cost-reflective market operations.

We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of particles (representing the objects) diffusing in some continuous space, analogou…

2014-08-14abs ↗pdf ↗

The paper optimizes DIA purchase policies using lifecycle models and asset allocation.

problem Determining the optimal allocation to Deferred Income Annuities (DIAs).
method Employed a lifecycle model with utility of consumption and bequest, formalized optimization process, analyzed results, and extended model to include asset allocation.
result Optimal DIA allocation varies based on refundability, asset allocation, and perceived longevity.

We present the Wright-Fisher Indian buffet process (WF-IBP), a probabilistic model for time-dependent data assumed to have been generated by an unknown number of latent features. This model is suitable as a prior in Bayesian nonparametric feature allocation models in which the features underlying the observed data exhi…

2016-11-22abs ↗pdf ↗

Research develops a DSS for stock selection and asset allocation using fundamental data.

problem Complex financial markets and limited use of fundamental data analysis.
method Data gathering, cleaning, and modeling of fundamental data; integration with macroeconomic conditions.
result Enhanced predictive model for mid- to long-term stock returns.

Enhances topic models to better handle polysemous words.

problem Lack of polysemy handling in Gaussian latent Dirichlet allocation.
method Introduces a hierarchical structure to capture polysemy in Gaussian latent Dirichlet allocation.
result Significantly improves polysemy detection and provides more parsimonious topic representations.

The paper uses SHAP for interpreting machine learning models in hospital data.

problem Interpreting machine learning models in healthcare.
method SHAP for feature importance and feature packing techniques.
result SHAP provides better interpretability of machine learning models in healthcare.

Optimal allocation between explainable and black box models for high performance and explainability.

problem Balancing explainability and performance in model ensembles.
method Optimal allocation of observations between explainable and black box models to maximize ensemble performance and explainability.
result Learned allocations maintain high ensemble performance and explainability, sometimes outperforming individual models.

The financial crisis showed the importance of measuring, allocating and regulating systemic risk. Recently, the systemic risk measures that can be decomposed into an aggregation function and a scalar measure of risk, received a lot of attention. In this framework, capital allocations are added after aggregation and can…

2016-07-12abs ↗pdf ↗