Generative Adversarial Network creates realistic halo merger trees.
problem Comparing galaxy formation theories with observations using halo merger trees.
method Treated halo merger tree construction as a matrix generation problem, using Generative Adversarial Network.
result Generated halo merger trees are of high quality and realistic.
Introduces halo products and studies their geometric properties.
problem Understanding the large-scale geometry of halo groups.
method Introduces halo products and builds a geometric framework.
result Provides refined invariants distinguishing halo groups up to quasi-isometry.
HALO uses local Lipschitz constants to optimize functions efficiently.
problem Efficiently solving global optimization problems with complex objective functions.
method Hybrid Adaptive Lipschizian Optimization (HALO) algorithm that estimates local Lipschitz constants and balances global and local information.
result HALO outperforms other global optimization algorithms on numerous test functions.
Generative model disentangles dark matter halo properties.
problem Entangling physical factors in generative model latent spaces.
method Auxiliary-variable-guided framework with halo mass and concentration.
result Reveals mass-concentration scaling relation and identifies unusual halo formation.
Core-Halo solves large-scale fixed-point problems by decentralizing updates.
problem Large-scale fixed-point equations with block dependencies.
method Core-Halo decomposition separates write ownership from read-only context, aligning with block-dependence structure.
result Core-Halo achieves near-centralized performance while retaining parallelism.
New geodesic rays found on hyperbolic surfaces with unique halo.
problem Existence of geodesic rays not asymptotic to lamination leaves.
method Analyzing intersections and lifts of measured geodesic laminations.
result Uncountable halo of geodesic endpoints disjoint from lamination leaves.
CHARM creates mock halo catalogs from dark matter density fields using neural networks.
problem Creating accurate mock halo catalogs for cosmological studies is computationally expensive.
method CHARM uses multi-stage neural spline flow networks to learn the mapping from dark matter density fields to halo catalogs.
result Mock halo catalogs have the same statistical properties as those from high-resolution N-body simulations.
HALO learns to prune neural networks by adaptively shrinking weights.
problem Sparsity and model size in deep neural networks.
method Bayesian hierarchical models and trainable parameters for adaptive sparsification.
result HALO learns to create highly sparse networks with significant performance gains.
Neural net reconstructs dark matter density from halo velocities.
problem Reconstructing local dark matter density from halo velocities.
method Hybrid architecture combining U-Net and DeepSets.
result Hybrid network recovers density amplitudes and phases better than U-Net.
Company mergers and acquisitions are often perceived to act as catalysts for corporate growth in free markets systems: it is conventional wisdom that those activities lead to better and more efficient markets. However, the broad adoption of this perception into corporate strategy is prone to result in a less diverse an…
Mass algorithm predicts M&A deals from patent data.
problem Hard to automatically predict M&A deals due to complex human skills.
method Machine learning-based similarity measure (MASS) applied to patent data.
result MASS outperforms LightGCN in forecasting M&A deals.
Study examines market reactions and spillovers in Japanese bank mergers using multiple methods.
problem Understanding valuation and spillover effects of bank mergers in the Japanese banking sector.
method Combines event study, VAR models, IRFs, and PSM to analyze two M&A events.
result Significant positive market reaction and prolonged positive spillovers detected.
This article extends, in a stochastic environment, the Yagil (1987) model which establishes, in a deterministic dividend discount model, a range for the exchange ratio in a stock-for-stock merger agreement. Here, we generalize Yagil's work letting both pre- and post-merger dividends grow randomly over time. If Yagil fo…
Pakistan examines digital mergers using traditional competition tools.
problem Regulating digital mergers in a developing country.
method Empirical comparative analysis of CCP's M&A decisions.
result CCP uses same decision factors for digital and traditional M&As.
Optimal execution strategy for merger & acquisition contracts with price impact.
problem Optimal execution and pricing of financial derivatives in M&A deals.
method Indifference utility arguments, considering linear and nonlinear contracts.
result Linear contracts are more expensive and vulnerable to manipulation.
New method resolves ambiguity in measuring black hole merger angular momentum.
problem Ambiguity in measuring angular momentum during black hole mergers.
method Quasilocal mass and optimal isometric embedding theory.
result New definition of angular momentum free of supertranslation ambiguity.
A new method learns stable, temporally coherent features in point clouds.
problem Flickering and halo structures in inferred solutions for time-varying point clouds.
method Proposes a novel temporal loss function and super-resolution method.
result Demonstrates flexibility and effectiveness on large, deforming point sets.
The present work has as principal objective analyze the evolution of the process of privatization, mergers and acquisitions of the big companies in the country in the last decades, to understand the conductive threads that formed the structural changes of the economy, in order world oligopólicas to insert it to the glo…
Study examines how mergers and acquisitions affect Indian banks' financial performance and capital structure.
problem Impact of mergers and acquisitions on Indian banks' financial performance and capital structure.
method Statistical analysis using paired t-test on selected banks' annual reports.
result Mergers and acquisitions significantly impact financial performance and capital structure of Indian banks.
The article improves the display of acceptable exchange ratios for merging companies.
problem Determining feasible exchange ratios for merging companies.
method Exploits a diagrammatic approach to display the bargaining region.
result Shares face upper and lower bounds for acceptable exchange ratios.
Illegal insider trading of stocks is based on releasing non-public information (e.g., new product launch, quarterly financial report, acquisition or merger plan) before the information is made public. Detecting illegal insider trading is difficult due to the complex, nonlinear, and non-stationary nature of the stock ma…
New method extracts cosmological information from dark matter halo catalogues using graph neural networks.
problem Quantifying cosmological information from large-scale structure data.
method Implicit likelihood approach with Information Maximising Neural Networks (IMNNs) on graph representations of dark matter halo catalogues.
result Graph neural network summaries can extract information from noisy catalogues and improve parameter constraints.
Gravitational waves are predicted by the general theory of relativity. In [6] D. Christodoulou showed that gravitational waves have a nonlinear memory. We proved in [3] that the electromagnetic field contributes at highest order to the nonlinear memory effect of gravitational waves. In the present paper, we study this …
Deep neural network predicts black hole merger remnants with high accuracy.
problem Estimating the properties of black hole merger remnants.
method Trained on a dataset of binary black hole simulations, a deep neural network predicts mass and spin with high precision.
result The network predicts remnant black hole mass and spin with errors less than 0.04% and 0.3% respectively, and reduces errors in precessing cases to half.
Study lampshuffler groups' isoperimetric profiles, refining previous estimates.
problem Relate isoperimetric profiles of lampshuffler groups to their base groups.
method Use lamplighter subgraphs and halo products to find optimal upper bounds.
result Sharp estimates for exponential growth groups, including Brieussel-Zheng groups.
New algorithm clusters GRBs into two groups: short and long duration.
problem Determining the number of clusters in gamma-ray bursts.
method Completely parameter-free clustering algorithm.
result Clusters indicate two main groups: short and long duration GRBs.
The FCA improved insider trading regulation after 2012, reducing abnormal returns.
problem Regulation of insider trading before and after the UK Financial Services Act 2012.
method Event study methodology using abnormal returns analysis.
result Abnormal returns were reduced after the FCA took over from the FSA.
Hybrid model speeds up galaxy simulations by incorporating baryonic properties.
problem Inaccurate baryonic properties in dark matter-only simulations.
method Combining analytic models and machine learning for faster, more accurate simulations.
result Hybrid model outperforms machine learning alone for some baryonic properties.
Empirical researchers are increasingly faced with rich data sets containing many controls or instrumental variables, making it essential to choose an appropriate approach to variable selection. In this paper, we provide results for valid inference after post- or orthogonal L2-Boosting is used for variable selection.…
We introduce deep learning models to estimate the masses of the binary components of black hole mergers, (m1,m2), and three astrophysical properties of the post-merger compact remnant, namely, the final spin, af, and the frequency and damping time of the ringdown oscillations of the fundamental ℓ=m=2 bar mo…
A concept of martingale-fair index of return, consistent with Arbitrage Free Pricing Theory, is introduced. An explicit formula for the average rate of return of a group of investment/pension funds in a discrete time stochastic model is derived and several properties of this index are shown. In particular, it is proven…
Paper predicts M&A deal success using ML and DL techniques.
problem Predicting the success of M&A deals to avoid costly mistakes.
method Data preprocessing with ML techniques, feedforward neural networks, and sentiment scores integration.
result Methodology outperforms benchmark models in preliminary tests.
Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…
Are large scale research programs that include many projects more productive than smaller ones with fewer projects? This problem of economy of scale is particularly relevant for understanding recent mergers in particular in the pharmaceutical industry. We present a quantitative theory based on the characterization of d…
Deep learning predicts M&A events in industry networks.
problem Predicting M&A behaviors in competitive industries with complex interdependencies.
method Temporal Dynamic Industry Network (TDIN) model using temporal point processes and deep learning.
result Effective M&A event prediction and actionable recommendations.
A new method models galaxies as points in space for better analysis.
problem Limitations of binning and voxelization in galaxy surveys.
method A diffusion-based generative model for galaxy point clouds.
result Demonstrated on dark matter haloes in Quijote simulations.
Constructs solutions of Einstein equations for black holes gluing along timelike geodesics.
problem Constructing solutions of Einstein equations for black holes gluing along timelike geodesics.
method Constructs solutions gε of the Einstein equations describing a mass ε Kerr black hole traveling along a timelike geodesic C. result Constructs true solutions gε of the Einstein equations for black holes gluing along timelike geodesics. A novel clustering method uses torque balance to group objects.
problem Grouping similar objects in various scientific fields.
method Inspired by gravitational interactions, a parameter-free clustering algorithm based on mass and distance.
result The algorithm effectively clusters objects regardless of their shape, size, or density.
Linear algebra approach for parallel deep learning models.
problem Training large DNNs in distributed environments.
method Linear algebraic approach to model parallelism.
result Manual development of backward operators for gradient-based training.
Study analyzes COFCO's acquisition of Mengniu Dairy, revealing financial and non-financial impacts.
problem Understanding the impact of COFCO's acquisition of Mengniu Dairy.
method Analyzes financial and non-financial contributions of Mengniu Dairy to COFCO.
result Provides insights for future corporate M&A activities in the dairy industry.
As part of Basel II's incremental risk charge (IRC) methodology, this paper summarizes our extensive investigations of constructing transition probability matrices (TPMs) for unsecuritized credit products in the trading book. The objective is to create monthly or quarterly TPMs with predefined sectors and ratings that …
We describe and document three mechanisms by which corporations can influence or even control stock prices. (i) Parent and holding companies wield control over other publicly traded companies. (ii) Through clever management of treasury stock based on buyback programs and stock issuance, stock price fluctuations can be …
Boosting meta-trees improve decision tree performance.
problem Overfitting in decision trees.
method Boosting approach to construct multiple meta-trees.
result Ensembles of meta-trees prevent overfitting.
Cluster-wise linear regression (CLR), a clustering problem intertwined with regression, is to find clusters of entities such that the overall sum of squared errors from regressions performed over these clusters is minimized, where each cluster may have different variances. We generalize the CLR problem by allowing each…
The paper studies geometric properties of quasi-trees and tree approximations.
problem Geometric properties and tree approximations of quasi-trees.
method Construction of a tree approximating quasi-trees, proving quasi-isometric properties.
result Every quasi-tree is (1,C)-quasi-isometric to a simplicial tree. Efficiently updates posterior tree distributions over meta-trees.
problem Updating posterior distributions over meta-trees efficiently.
method Batch updating method for posterior tree distributions.
result More efficient batch updating method.
This paper provides a holistic study of how stock prices vary in their response to financial disclosures across different topics. Thereby, we specifically shed light into the extensive amount of filings for which no a priori categorization of their content exists. For this purpose, we utilize an approach from data mini…
This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring the multiple tree approach. Ideally, we would like to consider predictio…