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

Trend · papers per month

179357536714 · Jun 202019922001200920172026
48 results for shared functionality

Optimal risk sharing without convex preferences using aggregate convexity.

problem Risk sharing among non-convex preferences.
method Aggregate convexity principles and Lyapunov convexity, combined with approximation arguments for law invariant risk measures.
result Derivation of a computationally tractable formula for the conjugate of the value function.

The paper examines how share buybacks impact a company's earnings per share.

problem The trade-off between reducing share count and decreasing net earnings due to share buybacks.
method Review of accretive share repurchases, analysis of EPS increase as a function of price paid, and quantification of earnings growth difference.
result Share buybacks can enhance EPS, but the net effect on earnings growth is mixed.

The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.

problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.

New model extracts shared brain activity patterns from fMRI data.

problem Challenges in aggregating multi-subject fMRI data due to variability.
method Shared Gaussian Process Factor Analysis (S-GPFA) incorporating temporal information.
result Model reveals ground truth latent structures and replicates experimental performance.

The paper extends deep multi-task learning to diverse domains, finding shared functionality.

problem General problem solving from diverse deep learning tasks.
method Decomposes tasks into subproblems, optimizing sharing through stochastic algorithm.
result Joint learning across diverse domains and architectures improves performance.

We use the theory of coherent measures to look at the problem of surplus sharing in an insurance business. The surplus share of an insured is calculated by the surplus premium in the contract. The theory of coherent risk measures and the resulting capital allocation gives a way to divide the surplus between the insured…

2018-10-28abs ↗pdf ↗

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.

Share prices of financial companies from the S&P 500 list have been modeled by a linear function of consumer price indices in the USA. The Johansen and Engle-Granger tests for cointegration both demonstrated the presence of an equilibrium long-term relation between observed and predicted time series. Econometrically, t…

2010-03-13abs ↗pdf ↗

PPG separates policy and value function training phases for better reinforcement learning efficiency.

problem Challenges in traditional reinforcement learning methods for policy and value function optimization.
method Integrates Phasic Policy Gradient framework that splits policy and value function training into distinct phases.
result Significantly improves sample efficiency on Procgen Benchmark compared to PPO.

Algorithm reduces regret in distributed kernel bandits with shared randomness.

problem Minimizing regret in collaborative function maximization.
method Uniform exploration at local agents and shared randomness with central server.
result Achieves optimal regret order with sublinear communication cost.

Paper investigates Lambda Value-at-Risk under ambiguity and risk sharing.

problem Investigates Lambda Value-at-Risk under ambiguity and risk sharing.
method Establishes equivalence of robust ΛΛVaR and traditional ΛΛVaR under ambiguity sets, analyzes properties, derives explicit formulas, and explores risk sharing.
result Unified and extended the concept of Value-at-Risk under ambiguity, derived explicit formulas for specific ambiguity sets, and explored risk sharing.

The paper studies an oligopolistic equilibrium model of financial agents who aim to share their random endowments. The risk-sharing securities and their prices are endogenously determined as the outcome of a strategic game played among all the participating agents. In the complete-market setting, each agent's set of st…

2012-06-02abs ↗pdf ↗

Improved AutoDML estimator for causal inference using outcome-adapted shared covariate representation.

problem Efficiency in estimating treatment or policy effects in causal inference.
method Outcome-adapted AutoDML estimator that uses a shared covariate representation that is predictive of the outcome but not the Riesz representer.
result Outcome-adapted AutoDML estimator is asymptotically more efficient than baseline AutoDML.

Generalizes risk sharing models to a continuum of agents.

problem Risk sharing among a large number of heterogeneous agents.
method Modeling agents as points in a measure space, using risk measures on a probability space, and deriving dual representations.
result Explicit formulas for specific risk measures (entropic and expected shortfall) and applications to Pareto efficiency.

Unified multitask learning framework for mixed-type outcomes.

problem Difficulty in formulating a unified objective for tasks with different outcomes.
method Multitask transformation framework with shared sparsity, using deep neural networks and rank-based optimization.
result Improved prediction and variable selection across continuous, binary, and mixed outcomes.

This work formalizes and extends parameter sharing in multi-agent reinforcement learning.

problem Parameter sharing limits multi-agent learning to a single policy, preventing different tasks or action spaces.
method Introduces agent indication and extends parameter sharing to heterogeneous observation and action spaces.
result Proves convergence to optimal policies for parameter sharing in heterogeneous environments.

Developed policy gradient methods for stochastic control with exit time, outperforming traditional techniques in share repurchase pricing.

problem Optimal control with exit time in stochastic models.
method Two types of algorithms: direct policy learning and alternately learning value function and control.
result Policy gradient methods outperform PDE or neural networks in share repurchase pricing.

Theoretical analysis of CNNs' inductive biases and their efficiency in approximating functions.

problem Understanding and optimizing the inductive biases in deep CNNs.
method Theoretical analysis combining multichanneling, downsampling, weight sharing, and locality.
result Deep CNNs with O(logd)\mathcal{O}(\log d) depth can approximate any continuous function, and require O~(log2d)\widetilde{\mathcal{O}}(\log^2d) samples for sparse functions.

Improves shared encoder representations for better multi-task learning performance.

problem Improving quality of shared encoder representations in multi-task learning.
method Dummy Gradient norm Regularization (DGR) to decrease gradient norm of dummy task-specific predictors.
result DGR improves multi-task prediction performances and superior performance compared to existing methods.

Paper provides new bounds for risk aggregation and sharing.

problem Quantitative risk management and robust risk aggregation with dependence uncertainty.
method Established new inequality for RVaR, derived extended convolution bounds, and analyzed risk sharing for averaged quantiles.
result Extended convolution bounds for robust risk aggregation and risk sharing, providing sharpness conditions and explicit expressions.

Study optimizes shared singular subspace estimation from noisy matrices.

problem Estimating shared singular subspaces across multiple noisy matrices.
method Low-rank matrix denoising framework with Stack-SVD and novel estimators.
result Stack-SVD achieves minimax rate-optimality for identical shared subspaces, and novel estimators for partial sharing.

Develops a machine-learning framework for optimal share repurchase hedging.

problem Challenges in hedging share repurchase programs due to market regulations and trading activity.
method Machine-learning framework that optimizes execution and hedging of share repurchase programs.
result Substantial performance improvements and an optimized hedging approach.

SHA improves fMRI alignment for cognitive state discovery.

problem Optimal functional alignment in MVP analysis for multi-subject fMRI data.
method Supervised Hyperalignment (SHA) method that maximizes correlation within same categories and minimizes between distinct categories.
result SHA achieves up to 19% better performance for multi-class problems.

Most deep reinforcement learning algorithms are data inefficient in complex and rich environments, limiting their applicability to many scenarios. One direction for improving data efficiency is multitask learning with shared neural network parameters, where efficiency may be improved through transfer across related tas…

2017-07-13abs ↗pdf ↗

New concept of attitude towards probability introduced in risk sharing problems.

problem Risk sharing problems and attitudes towards probability.
method Generalized definition of probability premium, local approximation, rank-dependent utility model, dual theory.
result Attitude towards probability can be first-order or second-order, depending on the model.

The study examines how weight sharing, equivariance, and locality affect the sample complexity of neural networks.

problem Understanding the impact of design choices on the generalization error of neural networks.
method Statistical learning theory applied to single hidden layer networks with weight sharing, equivariance, and locality.
result Lower and upper bounds for sample complexity are derived, showing that locality has benefits but comes with a trade-off.

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.

Decentralized detection avoids sharing data, controls false discoveries.

problem Global false discovery rate control in decentralized novelty detection.
method Quantized surrogate models for low-precision sharing, preserving exchangeability.
result Quantized composite scores maintain competitive statistical power with reduced communication.

As a highlighting research topic in the multimedia area, cross-media retrieval aims to capture the complex correlations among multiple media types. Learning better shared representation and distance metric for multimedia data is important to boost the cross-media retrieval. Motivated by the strong ability of deep neura…

2017-04-14abs ↗pdf ↗

Improved supervised EM learning for shared kernel models with feature space partitioning.

problem Lack of rigour in EM derivation and high computational complexity.
method Detailed derivation of EM for Gaussian shared kernel model, feature space partitioning to reduce complexity.
result Improved performance at reduced complexity achieved.

BIDIFAC integrates multi-platform, multi-cohort data for shared and unique patterns.

problem Integration of multi-platform, multi-cohort data for shared and unique patterns.
method BIDIFAC integrates bidimensionally linked matrices into four components: globally shared, row-shared, column-shared, and single-matrix structural components.
result BIDIFAC reveals shared and unique patterns of variability in multi-platform, multi-cohort data.

BASIS improves LLM reasoning by sharing batchwise rollout info, reducing MSE by 69%.

problem Improving large language model reasoning with limited rollouts and batch information.
method BASIS samples only one rollout per prompt but uses batch information to improve value function estimation.
result BASIS reduces MSE in value function estimation by 69% compared to REINFORCE++.

Toehold purchase, defined here as purchase of one share in a firm by an investor preparing a tender offer to acquire majority of shares in it, reduces by one the number of shares this investor needs for majority. In the paper we construct mathematical models for the toehold and no-toehold strategies and compare the exp…

2012-04-10abs ↗pdf ↗