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

Trend · papers per month

24497397 · May 202619922001200920172026
48 results for share buybacks

This thesis identifies share buybacks and predicts their impact on stock performance.

problem Recognizing and predicting the impact of share buybacks on stock performance.
method NLP approaches for automated detection of share buybacks, machine learning models for prediction.
result Most companies underperform after a share buyback, but some significantly outperform.

New method optimizes share buyback contracts without optimal control's limitations.

problem High-dimensional state spaces and risk penalty selection issues in traditional methods.
method Applies optimized heuristic strategies and classical pricing methods.
result Maximizes contract value and disentangles repurchase from hedging.

This paper aims to explore the mechanical effect of a company's share repurchase on earnings per share (EPS). In particular, while a share repurchase scheme will reduce the overall number of shares, suggesting that the EPS may increase, clearly the expenditure will reduce the net earnings of a company, introducing a tr…

2019-11-11abs ↗pdf ↗

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.

LEMs extend transformer-based architectures for complex execution problems.

problem Handling flexible time boundaries and multiple execution constraints in deep learning.
method Decouples market information processing from execution allocation decisions using TKANs, VSNs, and multi-head attention mechanisms.
result LEMs achieve superior execution performance compared to traditional benchmarks.

We argue that an important contributing factor into market inefficiency is the lack of a robust mechanism for the stock price to rise if a company has good earnings, e.g., via buybacks/dividends. Instead, the stock price is prone to volatility due to rather random perception/interpretation of earnings announcements (am…

2015-11-04abs ↗pdf ↗

A framework for anonymized risk sharing without revealing identities or preferences.

problem Risk sharing without revealing individual identities or preferences.
method Axiomatic framework with four key axioms: actuarial fairness, risk fairness, risk anonymity, and operational anonymity.
result The conditional mean risk sharing rule is uniquely characterized by these axioms.

Boosts share routing for multi-task learning with flexible sparse connections.

problem Designing suitable sharing mechanisms among multiple tasks in multi-task learning.
method Proposes MTNAS framework to modularize sharing into sub-networks with sparse connections and gating.
result Demonstrates consistent improvement over single-task and typical multi-task methods while maintaining efficiency.

The paper defines fair profit sharing ratios in Islamic PL contracts.

problem Determining fair profit sharing ratios in Islamic PL contracts.
method Introduces cc-fair profit sharing ratios and uses econometrics models to compute or approximate them.
result Elucidates the relation between profit sharing ratios and economic factors.

We statistically investigate the distribution of share price and the distributions of three common financial indicators using data from approximately 8,000 companies publicly listed worldwide for the period 2004-2013. We find that the distribution of share price follows Zipf's law; that is, it can be approximated by a …

2017-02-01abs ↗pdf ↗

Through a short sale, a person borrows a share of stock from a lender, sells the borrowed share to a third person at the current price, and purchases an identical share in the market at a future date and at a future price to replace the borrowed share of stock. This only makes sense if the short seller anticipates a do…

2017-12-28abs ↗pdf ↗

This paper analyzes stock market data to predict share prices using regression models.

problem Predicting stock prices in the share market of Bangladesh.
method Thorough linear regression analysis on Dhaka Stock Exchange data, compared with random forest.
result Random forest model performs better than linear regression for predicting stock prices.

Algorithm learns which weights to share in deep multi-task learning.

problem Difficulty in deciding which weights to share between tasks in deep learning models.
method Combines natural evolution strategy and stochastic gradient descent to learn optimal weight sharing.
result Task-specific networks achieve lower test errors than existing methods on multi-task learning datasets.

Model improves covariance estimation from shared and distinct datasets.

problem Limited sample sizes and shared covariance structure across related datasets.
method Spiked covariance model with shared subspace, closed-form pooling weight, and asymptotic guarantees.
result Improves estimation of high-dimensional covariance matrices from related datasets.

The large majority of risk-sharing transactions involve few agents, each of whom can heavily influence the structure and the prices of securities. This paper proposes a game where agents' strategic sets consist of all possible sharing securities and pricing kernels that are consistent with Arrow-Debreu sharing rules. F…

2014-12-13abs ↗pdf ↗

Developed a new algorithm to improve dynamic treatment regimens.

problem Non-convergence of Q-learning-based Q-shared algorithm in dynamic treatment regimens.
method Penalized Q-shared algorithm to address convergence issues.
result The penalized Q-shared algorithm converges and outperforms the original in various settings.

HCL learns shared and modality-specific latent representations for multimodal data.

problem Binary shared-private decomposition inadequately represents shared information across subsets of modalities.
method Hierarchical Contrastive Learning framework combining latent-variable formulation, structural sparsity, and contrastive objective.
result HCL accurately recovers hierarchical structure and improves predictive performance on multimodal data.

Researchers develop a method to measure treatment effects in settings with shared states.

problem Measuring treatment effects in settings with shared states like prices, recommendations, or social signals.
method Double machine learning (DML) theorem with conditions for efficient inference under shared-state interference.
result Efficient estimation of average direct effect (ADE) and global average treatment effect (GATE) in various models.

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 ↗

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.

With the success of deep neural networks, Neural Architecture Search (NAS) as a way of automatic model design has attracted wide attention. As training every child model from scratch is very time-consuming, recent works leverage weight-sharing to speed up the model evaluation procedure. These approaches greatly reduce …

2020-01-06abs ↗pdf ↗

Bayesian interpretations of neural network have a long history, dating back to early work in the 1990's and have recently regained attention because of their desirable properties like uncertainty estimation, model robustness and regularisation. We want to discuss here the application of Bayesian models to knowledge sha…

2019-12-02abs ↗pdf ↗

We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with sa…

2016-03-07abs ↗pdf ↗

New method identifies shared components from unpaired multimodal mixtures.

problem Identify shared components from unpaired multimodal mixtures.
method Distribution divergence minimization-based loss with sufficient conditions for identifiability.
result Sufficient conditions for shared component identifiability from unaligned multimodal mixtures.

PerPCA separates unique and shared features from heterogeneous data.

problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.

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.

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 ↗

A new framework forecasts stock trends by mining shared information from concepts.

problem Forecasting stock trends using static concept information limits accuracy.
method Proposes a graph-based framework that mines concept-oriented shared information from both predefined and hidden concepts.
result Improves stock trend forecasting performance through dynamic concept relevance and hidden concept information.

A mechanism to share risks and costs with guarantees against extreme outcomes.

problem Softening extreme individual burdens in risk sharing schemes.
method Formalizes Certified Allocation Problem; uses Conformal Risk Sharing with interpretable sharing policy and split conformal calibration.
result Reduces extreme obligations for high-risk agents while controlling harm to others.

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.

Weight-sharing (WS) has recently emerged as a paradigm to accelerate the automated search for efficient neural architectures, a process dubbed Neural Architecture Search (NAS). Although very appealing, this framework is not without drawbacks and several works have started to question its capabilities on small hand-craf…

2020-02-11abs ↗pdf ↗

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.

Study shows automorphisms of Markov surfaces share periodic points if they share a common iterate.

problem Study of unlikely intersections for automorphisms of Markov surfaces with positive entropy.
method Arithmetic equidistribution for adelic line bundles, theory of laminar currents, quasi-Fuchsian representation theory.
result Two automorphisms with positive entropy share a Zariski dense set of periodic points if and only if they share a common iterate.

This paper evaluates heuristics and hyperparameters in weight-sharing NAS methods.

problem Improving the performance of weight-sharing NAS methods.
method Systematic evaluation of heuristics and hyperparameters in weight-sharing NAS algorithms.
result Some heuristics negatively impact super-net and stand-alone performance correlation.