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

4.5%9.0%13.5%18.1% · May 202619922001200920172026
48 results for parameter allocation

Lapse improves parameter servers by dynamically allocating parameters, achieving near-linear scaling.

problem Efficiently managing distributed training with reduced communication overhead.
method Integrate dynamic parameter allocation into parameter servers, proposing Lapse.
result Lapse provides near-linear scaling and can be orders of magnitude faster than existing parameter servers.

Investigates optimal parameter allocation in Transformers for efficiency and expressivity.

problem Balancing expressivity and efficiency in Transformer model parameters.
method Mathematical analysis and theoretical characterization of attention heads and head dimensions.
result Later layers can operate more efficiently with reduced parameters due to saturation of softmax activations.

Proposes a method to allocate time budgets in mixed criticality systems.

problem Managing execution time variability in mixed criticality systems.
method Quantifies execution time variability using statistical dispersion parameters and proposes a heuristic to allocate time budgets.
result The proposed heuristic reduces the probability of exceeding allocated budgets.

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.

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 ↗

Optimizes resource allocation for distributed parameter estimation in sensor networks.

problem Maximizing accuracy in parameter estimation with limited resources.
method Formulates a data collection and collaboration policy design problem as a Fisher information maximization problem. Proposes multi-armed bandit algorithms for learning the optimal policy.
result Identifies optimal data collection and collaboration policies that balance resource use and estimation accuracy.

Although modern portfolio theory has been in existence for over 60 years, fund managers often struggle to get its models to produce reliable portfolio allocations without strongly constraining the decision vector by tight bands of strategic allocation targets. The two main root causes to this problem are inadequate par…

2013-10-12abs ↗pdf ↗

StatLoRA uses statistical inference to allocate ranks in LoRA fine-tuning, improving performance.

problem Balancing efficiency, expressiveness, and generalization in LoRA rank allocation.
method Formulates LoRA rank allocation as a statistical hypothesis testing problem, using estimated p-values to determine component retention or pruning.
result StatLoRA achieves comparable or better performance than existing methods under matched rank budgets.

Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.

problem Sequential budget allocation in ranking and selection
method Annealed weighted soft-min framework
result Surrogate converges uniformly to the hard minimum, soft-min weights concentrate on active challengers, and target allocation map is continuous.

Scheduling and power allocation improve federated learning efficiency in NOMA networks.

problem Efficiently scheduling and allocating power for federated learning in bandwidth-limited wireless networks.
method Proposed a scheduling policy and power allocation scheme using NOMA to maximize data rate and convergence speed.
result Simulation results show improved federated learning accuracy in NOMA networks.

Unified framework for optimizing portfolios with distributions over weights, returns, and parameters.

problem Traditional portfolio optimization treats expected returns, covariances, and allocations as fixed. Modern practice replaces at least one with a distribution.
method Unified framework using Gamma_theta(dw,dr) coupling to organize Bayesian, robust, chance-constrained, stochastic-allocation, and distributional reinforcement-learning methods.
result Synthetic and structural contributions, including a portfolio specialization of Wasserstein-CVaR duality and a static no-randomization theorem.

NPAS trains neural networks with a fixed parameter budget, improving performance and compactness.

problem Training neural networks requires memory, and existing methods struggle with arbitrary parameter budgets.
method NPAS learns to share parameters automatically, covering low and high budgets.
result NPAS and SSNs improve network performance and compactness across various tasks.

Robo-advisors use MPC to create dynamic investment strategies.

problem Static allocation methods limit robo-advisors' effectiveness.
method Combines MPC with Hidden Markov Model and Black-Litterman for dynamic asset allocation.
result MPC-based strategies outperform static approaches in dynamic and risk-budgeting criteria.

Study optimal adaptive allocation for multi-armed bandits with Markovian rewards.

problem Optimal adaptive allocation for multi-armed bandits with Markovian rewards.
method Round-robin Kullback-Leibler upper confidence bounds for optimal adaptive allocation.
result Logarithmic dependence of regret on time horizon, asymptotically optimal.

The paper proposes a machine learning approach for state-dependent asset allocation.

problem Market conditions cause performance deviations from long-term averages.
method Analyzes historical market states and asset returns to directly relate state variables to portfolio weights.
result The proposed approach generates a more efficient portfolio compared to traditional methods.

Bayesian approach improves AdaLoRA's performance and efficiency.

problem Improving the efficiency and performance of adaptive low-rank adaptation.
method Utilized Bayesian metrics and the Improved Variational Online Newton (IVON) optimizer for adaptive parameter budget allocation.
result Bayesian counterpart outperforms sensitivity-based importance metric and is faster than AdaLoRA.

A new DNN structure reduces complexity for wireless tasks.

problem Reducing complexity in training deep neural networks for wireless tasks.
method Proposes a DNN with special structure using permutation invariant a priori information.
result The proposed DNN structure reduces training complexity and model parameters.

Paper proposes OPF policy for fair resource allocation with sublinear regret.

problem Fair resource allocation in an online setting against an unrestricted adversary.
method Online Proportional Fair (OPF) policy achieving approximate sublinear regret.
result OPF policy achieves cαc_α-approximate sublinear regret with cα1.445c_α \leq 1.445.

Estimates expected information gain using density approximations and dimension reduction.

problem Estimating expected information gain in nonlinear and non-Gaussian settings.
method Flexible transport-based schemes for EIG estimation, optimal sample allocation, and gradient-based upper bounds on mutual information.
result Optimal sample allocation and dimension reduction schemes improve EIG estimation accuracy and convergence rate.

We consider the classical problem of sequential resource allocation where a decision maker must repeatedly divide a budget between several resources, each with diminishing returns. This can be recast as a specific stochastic optimization problem where the objective is to maximize the cumulative reward, or equivalently …

2019-02-12abs ↗pdf ↗

Paper introduces Market-adaptive Ratio for better portfolio management.

problem Traditional risk-adjusted ratios fail to account for bull and bear markets.
method Integrates ρρ parameter and uses reinforcement learning to adjust portfolio allocations dynamically.
result Market-adaptive Ratio outperforms traditional ratios in bull and bear markets.

Framework for online resource allocation using social welfare functions.

problem Optimal allocation of resources over time steps in a population.
method Confidence sequence framework for SWF-based online learning and inference, valid for any monotonic, concave, and Lipschitz-continuous SWF.
result Achieves near-optimal regret of ildeO(n+nkT) ilde{O}(n+\sqrt{nkT}) for SWF-agnostic algorithm SWF-UCB.

Dynamic risk factor model improves portfolio performance in high dimensions.

problem Dynamic portfolio allocation in high-dimensional financial markets.
method Time-varying sparsity on factor loadings, sequential learning of parameters and volatilities.
result Significant portfolio performance improvements and higher utility gains.

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 ↗

RDL-Net improves speech enhancement with fewer parameters and better performance.

problem Improving speech enhancement with fewer parameters and better performance.
method Proposes RDL-Net, a CNN combining residual and dense aggregations without over-allocating parameters.
result RDL-Net achieves higher speech enhancement performance with fewer parameters and lower computational requirements.

The study identifies core and satellite segments in the cryptocurrency market.

problem Identifying similar cryptocurrencies for strategic asset allocation.
method Segmentation of the cryptocurrency market using image / pattern recognition methods.
result Core and satellite segments identified in the cryptocurrency market.

This paper optimizes portfolio selection by penalizing tracking error, improving Sharpe ratio.

problem Optimizing portfolio allocation with a penalty for deviation from a reference portfolio.
method Formulated as a McKean-Vlasov control problem, provides explicit solutions and asymptotic expansions.
result The penalized portfolio strategy outperforms standard mean-variance and reference portfolios in most cases.

New algorithm learns optimal resource allocation in wireless systems without models.

problem Learning optimal resource allocation in wireless systems without system models.
method Developed a model-free primal-dual algorithm using smoothed surrogates of constrained problems.
result The algorithm can make the gap between optimal values and dual values arbitrarily small.

Neural networks enjoy widespread use, but many aspects of their training, representation, and operation are poorly understood. In particular, our view into the training process is limited, with a single scalar loss being the most common viewport into this high-dimensional, dynamic process. We propose a new window into …

2019-09-03abs ↗pdf ↗

The paper introduces isotropy as a regularizer to enhance portfolio stability.

problem Model uncertainty and estimation errors in diversification strategies.
method Integrates isotropy as a geometric regularizer into mean-variance optimization.
result Isotropy constraint systematically induces negative average-signal exposure, providing a robust crash hedge.

We study the problem of multimodal generative modelling of images based on generative adversarial networks (GANs). Despite the success of existing methods, they often ignore the underlying structure of vision data or its multimodal generation characteristics. To address this problem, we introduce the Dirichlet prior fo…

2018-12-17abs ↗pdf ↗

Spatial statisticians and quantitative investors use the same mathematical object: a Schur complement, damped by one parameter.

problem The Schur complement is used in both spatial modeling and portfolio allocation, but the parameters are different.
method The Schur complement is interpreted as reliability shrinkage of a conditional Gaussian.
result The Schur complement is the same in both applications.

Meta-learning performance is affected by how task diversity is allocated, not just overall variability.

problem Meta-learning performance degrades when task diversity is unevenly distributed.
method Decomposed task-specific regression effects into structurally informative and orthogonal components.
result Meta-learning prediction degrades when a larger fraction of task variability is orthogonal and non-informative.