The paper develops a model to predict IPO events in private equity investments.
problem Lack of publicly available quantitative information for predicting IPO events.
method Combines neural network and survival analysis for predicting IPO probability.
result The neuro-survival model accurately predicts IPO events across various sectors.
Social media hype can misprice IPO stocks, leading to short-term gains but long-term losses.
problem Mispricing of IPO stocks due to social media hype.
method Analysis of investor emotions on StockTwits and Twitter.
result High pre-IPO enthusiasm leads to higher short-term returns but lower long-term returns.
Biotech IPOs in Q1 2021: advanced degrees, clinical trials, and IP key.
problem Identifying traits of biotech startups that go public.
method Database of biotech IPOs, analysis of leadership, technology, clinical trials, and financing.
result Advanced degrees, clinical trials, and IP are important for biotech startups.
Study predicts startup outcomes like funding, patenting, IPOs using machine learning.
problem Forecasting startup success metrics like funding, patenting, IPOs.
method Developed interpretable machine learning framework, used preprocessing, class imbalance handling, and compared multiple models.
result Achieved high AUROC values for patent, funding, and exit predictions.
Study shows registration regime improves IPO pricing efficiency in China.
problem Improving IPO pricing efficiency in China's entrepreneurial boards.
method Examined the impacts of regime changes and rule implementations on IPO pricing efficiency.
result The registration regime is most efficient in Chinese IPO pricing.
This study examines how ChiNext IPOs' initial returns are influenced by regulation regime changes.
problem Investors' behavior and pricing of ChiNext IPOs under different regulation regimes.
method Analysis of three time periods with two different regulation regimes and three sets of listing day trading restrictions.
result Regulation regime changes significantly impact ChiNext IPO pricing and overreaction.
Paper shows equivalence between two alignment methods and introduces a new algorithm.
problem Ensuring human alignment of large language models for useful, safe, and pleasant user experience.
method Introduces IPO-MD algorithm, showing equivalence between IPO and Nash-MD methods.
result Equivalence between IPO and Nash-MD methods proven when considering online version of IPO.
Study finds dividend policy has no significant effect on IPO stock prices.
problem Impact of dividend policy on IPO price performance.
method Long-run performance statistics and GARCH model, dummy variable used.
result Dividend policy has no significant effect on IPO stock prices.
Study uses LLMs to optimize VC exit timing after IPO.
problem Optimal exit timing after IPO is crucial but not well studied.
method Uses LLMs to analyze financial data and market signals.
result LLMs can improve VC exit timing and generate better returns.
A new method to value IPOed companies.
problem Valuing companies after IPO.
method Growth Average U1 method.
result Benchmark stocks using linear extrapolation of revenues and profits.
The complex networks approach has been gaining popularity in analysing investor behaviour and stock markets, but within this approach, initial public offerings (IPO) have barely been explored. We fill this gap in the literature by analysing investor clusters in the first two years after the IPO filing in the Helsinki S…
Study finds billing codes at IPO boost digital health companies' financial performance.
problem Identifying factors that drive long-term financial success in digital health companies.
method Analyzed 33 digital health IPOs from 2010-2021, comparing companies with and without billing codes.
result Companies with billing codes at IPO were significantly more likely to achieve positive CAGR and higher market capitalization.
IPO Finance Agent evaluates LLMs on SpaceX IPO due diligence, surpassing Finance Agent v2.
problem Evaluating language models on financial tasks like IPO due diligence.
method Introducing IPO Finance Agent and an evaluator-optimizer pipeline.
result The best-performing model reaches 79.4% accuracy at 0.30 USD per query.
New method accurately reconstructs Russell 3000 index, revealing crowded portfolios.
problem Crowding in index portfolios during reconstitution events.
method Developed a Python package for accurate index reconstruction using CRSP US Stock data.
result Annual Russell 3000 portfolios are more crowded than quarterly ones, suggesting lower transaction costs.
IPO Finance Agent extends Finance Agent v2 for SpaceX S-1 filings, improving accuracy and cost-efficiency.
problem Evaluating IPO due diligence tasks with long-form documents.
method Extended task domain, improved agentic harness with contextual retrieval, automated rubric generation.
result Best-performing model reaches 79.8% accuracy, cost-efficient model at 77.2% with 0.05 USD per query.
On December 16th, 2011, Zynga, the well-known social game developing company went public. This event followed other recent IPOs in the world of social networking companies, such as Groupon or Linkedin among others. With a valuation close to 7 billion USD at the time when it went public, Zynga became one of the biggest …
On December 16, Zynga, the well-known social game developing company went public. This event is following other recent IPOs in the world of social networking companies, such as Groupon, Linkedin or Pandora to cite a few. With a valuation close to 7 billion USD at the time when it went public, Zynga has become the bigge…
In this paper, we study reinforcement learning (RL) algorithms to solve real-world decision problems with the objective of maximizing the long-term reward as well as satisfying cumulative constraints. We propose a novel first-order policy optimization method, Interior-point Policy Optimization (IPO), which augments the…
Predicting the exit (e.g. bankrupt, acquisition, etc.) of privately held companies is a current and relevant problem for investment firms. The difficulty of the problem stems from the lack of reliable, quantitative and publicly available data. In this paper, we contribute to this endeavour by constructing an exit predi…
Recent academic work has developed a method to determine, in real time, if a given stock is exhibiting a price bubble. Currently there is speculation in the financial press concerning the existence of a price bubble in the aftermath of the recent IPO of LinkedIn. We analyze stock price tick data from the short lifetime…
Predicting startup success using Crunchbase data and deep learning.
problem Predicting startup success in a volatile entrepreneurial ecosystem.
method Novel deep learning model integrating funding metrics, founder features, and industry category.
result Achieved 14 times capital growth and identified high-potential startups.
Recurrent Networks are one of the most powerful and promising artificial neural network algorithms to processing the sequential data such as natural languages, sound, time series data. Unlike traditional feed-forward network, Recurrent Network has a inherent feed back loop that allows to store the temporal context info…
Study investor attention using search volume data before and after mobile device popularity.
problem Accurately measure investor attention in a fast-paced market.
method Compare investor attention using search volume data before and after mobile device popularization.
result Investor attention measured using search volume data is more accurate and faster after mobile device popularization.
Empirical study of CAPM and Fama-French model in Chinese A-share market.
problem Testing and validating CAPM and Fama-French model in Chinese A-share market.
method Used Fama-MacBeth regression and Fama-French three-factor model to analyze Chinese A-share trading data from 2000 to 2019, adjusting for IPO shell value contamination.
result Fama-French model captures most of A-share market returns, with adjusted R-squared > 0.88.
We present a novel methodology to determine the fundamental value of firms in the social-networking sector based on two ingredients: (i) revenues and profits are inherently linked to its user basis through a direct channel that has no equivalent in other sectors; (ii) the growth of the number of users can be calibrated…
Paper tackles reinforcement learning generalization through invariant policy optimization.
problem Learning policies that generalize beyond training domains.
method Invariant policy optimization principle and novel learning algorithm IPO.
result Significant improvements in generalization performance on unseen domains.
We study a practical optimization problems for venture capital investments and/or Research and Development (R&D) investments. The first problem is that, given the amount of the initial investment and the reward function at the initial public offering (IPO) market, the venture capitalist wants to maximize overall discou…
Study analyzes profitability and efficiency of Chinese banks, finding state-owned banks superior.
problem Analyzing efficiency and profitability of Chinese banks over time.
method Used Data envelopment analysis (Super-SBM-UND-VRS based DEA) model considering non-performing loans as undesired output.
result State-owned banks and Rural/City Commercial Banks have better profitability super-efficiency than Joint-stock Banks.
We propose an option approach for pricing bond illiquidity that is reminiscent of the celebrated work of Longstaff (1995) on the non-marketability of some non-dividend-paying shares in IPOs. This approach describes a quite common situation in the fixed income market: it is rather usual to find issuers that, besides liq…
SAIL improves online alignment of large language models with minimal feedback.
problem Offline RLHF methods often lead to sub-optimal performance due to fixed preference datasets.
method SAIL uses bilevel optimization and a single-level first-order method to iteratively refine model alignment.
result SAIL significantly improves alignment performance on open-sourced datasets with minimal computational overhead.
This paper explores how imperfect reward models can improve online RLHF.
problem Sample efficiency in online RLHF from imperfect reward models.
method Identifies policy coverability and proposes TPO algorithm for transfer learning.
result TPO algorithm improves sample efficiency compared to standard online learning.
A new method for RLHF using proximal point Nash learning.
problem Capturing real human preferences in RLHF.
method Proximal point Nash learning, embedding self-play updates into a proximal point framework.
result High-probability last-iterate convergence for the combined method.
This research examines relationship between staging of Venture Capital (VC) investments and social feedback visible in publicly available data on the Web. We address the question of Venture Capital investment sensitivity to performance and prospects of new venture, given as likelihood of obtaining future financing, ava…
We consider the problem of evaluating the quality of startup companies. This can be quite challenging due to the rarity of successful startup companies and the complexity of factors which impact such success. In this work we collect data on tens of thousands of startup companies, their performance, the backgrounds of t…
SRPO improves AI alignment with human preferences through self-improvement and task-independent optimization.
problem AI models trained with RLHF lack self-correction mechanisms and struggle with task generalization.
method SRPO formulates the preference learning problem as a min-max objective, optimizing a self-improvement policy and a generative policy in an adversarial fashion, making the solution task-independent.
result SRPO outperforms existing methods, achieving 90% AI Win-Rate on XSum and 56% on Arena-Hard prompts after a single revision.
SPPO optimizes language model alignment by treating preferences as a game and achieving state-of-the-art performance.
problem Capturing intransitivity and irrationality in human preferences for accurate language model alignment.
method Self-play-based approach to identify Nash equilibrium policy through iterative policy updates.
result SPPO achieves state-of-the-art win-rate of 28.53% on AlpacaEval 2.0 without external supervision.
Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.
problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.
This paper re-examines conformal e-prediction and its advantages over conformal prediction.
problem The relationship between conformal prediction and conformal e-prediction.
method Systematic re-examination of conformal prediction and conformal e-prediction from a modern perspective.
result Conformal e-prediction has advantages such as ease of designing conditional predictors and guaranteed validity of cross-predictors.
Self-calibrating conformal prediction improves interval efficiency and offers a practical alternative.
problem Improving the reliability and uncertainty quantification of machine learning predictions.
method Combines Venn-Abers calibration and conformal prediction for binary and regression problems.
result Improves interval efficiency through model calibration and offers practical alternatives.
Study uses deep learning to predict asset prices, finds complex target processes lead to meaningless predictions.
problem Complexity of successful price prediction models hinders understanding.
method Deep learning models for high-frequency price prediction, focusing on volatility and directional prediction.
result Inadequately defined target price process renders predictions meaningless.
The paper emphasizes the importance of joint predictions over marginal predictions for decision-making.
problem The need for accurate joint predictions in decision-making problems.
method The paper analyzes combinatorial decision problems, sequential predictions, and multi-armed bandits, introducing an approximate Thompson sampling algorithm and new regret bounds.
result Accurate joint predictions are essential for good performance in decision-making problems.
Behavior modification improves prediction accuracy by nudging user behavior.
problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.
Conformal predictive systems are a recent modification of conformal predictors that output, in regression problems, probability distributions for labels of test observations rather than set predictions. The extra information provided by conformal predictive systems may be useful, e.g., in decision making problems. Conf…
Predictions can shape outcomes, study helps predict these effects.
problem Understanding how predictions influence real-world outcomes.
method Causal identifiability analysis of prediction-covariate-outcome relationships.
result Standard supervised learning can identify transferable relationships from predictions.
Prediction problems often admit competing models that perform almost equally well. This effect challenges key assumptions in machine learning when competing models assign conflicting predictions. In this paper, we define predictive multiplicity as the ability of a prediction problem to admit competing models with confl…
Proposes feature conformal prediction for broader application in semantic feature spaces.
problem Establishing valid prediction intervals in semantic feature spaces.
method Extends conformal prediction to semantic feature spaces using deep representation learning.
result Feature conformal prediction outperforms regular conformal prediction under mild assumptions.
Acute kidney injury (AKI) commonly occurs in hospitalized patients and can lead to serious medical complications. In order to optimally predict AKI before it develops at any time during a hospital stay, we present a novel framework in which AKI is continually predicted automatically from EHR data over the entire hospit…
AutoCP automates the construction of accurate prediction intervals.
problem Creating valid and accurate prediction intervals for machine learning models.
method AutoML framework that optimizes prediction interval length for better accuracy and less conservatism.
result AutoCP significantly outperforms benchmark algorithms in constructing accurate prediction intervals.