A fast, accurate method for pricing American options with free boundaries.
problem Pricing American options with free boundaries efficiently and accurately.
method A sixth-order compact finite difference scheme with a dynamic staggered boundary scheme and 3(2) R-K Bogacki-Shampine time stepping.
result An efficient sixth-order compact scheme for pricing American options with free boundaries.
Paper develops robust econometric methods for staggered adoption studies.
problem Estimation challenges in event studies with staggered adoption.
method Design-first framework with exact probability limits, diagnostics, and orthogonal score constructions.
result Uniformly valid inference under restricted violations of parallel trends.
Study uses exchangeable GPs for staggered-adoption policy evaluation in panel data.
problem Evaluating the impact of staggered treatments in panel data settings.
method Exchangeable multi-task Gaussian processes (GPs) with flexible kernels.
result Flexible tool for policy evaluation in panel data settings.
A new estimator reduces bias and improves efficiency for staggered adoption studies.
problem Bias in difference-in-differences estimates for staggered adoption studies.
method Fused Extended Two-Way Fixed Effects (FETWFE) estimator with automatic parameter selection.
result FETWFE identifies correct restrictions with probability tending to one, improving efficiency.
Cluster jackknife improves inference for staggered DID methods.
problem Over-rejection of CSDID in small clusters or treated clusters.
method Cluster jackknife for CSDID inference.
result Cluster jackknife greatly improves inference for CSDID.
We address a class of schemes for the Euler equations with the following features: the space discretization is staggered, possible upwinding is performed with respect to the material velocity only and the internal energy balance is solved, with a correction term designed on consistency arguments. These schemes have bee…
Estimating treatment effects in time series with hidden confounding.
problem Estimating treatment effects in time series with hidden confounding.
method A neural framework that learns individual-level counterfactuals and flexible matching procedures.
result Improves counterfactual estimation under latent bias.
The scheduling of films is a major problem for the movie theatre exhibition business. The problem is two-fold: movie exhibitors ideally would like to schedule films to screens in their various locations to maximize attendance and revenue, but would also like to schedule these films such that neighbouring theatre locati…
Interactive IL beats BC by state-wise annotation cost.
problem Behavior Cloning struggles with annotation cost in sequential decision making.
method Proved Stagger and Warm Stagger algorithms to outperform BC.
result Interactive and hybrid IL methods outperform BC with state-wise annotation.
This article reviews recent advances in convex optimization algorithms for Big Data, which aim to reduce the computational, storage, and communications bottlenecks. We provide an overview of this emerging field, describe contemporary approximation techniques like first-order methods and randomization for scalability, a…
Simple method for estimating missing panel data entries with confidence intervals.
problem Estimating missing values in panel data with staggered adoption.
method Simple matrix algebra and singular value decomposition for estimation, with data-driven confidence intervals.
result Confidence intervals match non-asymptotic lower bounds, proving instance optimality.
Digital transformation boosts corporate financial asset allocation, especially short-term.
problem Understanding how digital transformation affects corporate financial decisions.
method Fixed-effects models and staggered DID design using A-share listed companies data.
result Digital transformation significantly promotes corporate financial asset allocation, more pronounced in short-term.
We consider a numerical approach for the incompressible surface Navier-Stokes equation. The approach is based on the covariant form and uses discrete exterior calculus (DEC) in space and a semi-implicit discretization in time. The discretization is described in detail and related to finite difference schemes on stagger…
We investigate 17 digital currencies making an analogy with quantum systems and develop the concept of eigenportfolios. We show that the density of states of the correlation matrix of these assets shows a behavior between that of the Wishart ensemble and one whose elements are Cauchy distributed. A metric for the parti…
Monopoly breakup impacts AT&T and AMX's market value by 65% and 32%.
problem Understanding how financial markets value monopoly rents post-breakup.
method Univariate structural time series models to estimate pre-breakup and post-breakup values.
result Monopoly breakup significantly impacts market capitalization, as shown by AT&T and AMX.
Enhances UPSA to reduce noise in financial data.
problem Noise in financial data affects UPSA's performance.
method Time-averaging optimal penalty weights and using Average Oracle correlation eigenvalues.
result Combining time-averaging and Average Oracle correlation eigenvalues improves UPSA's performance.
Bayesian methods improve DiD analysis for ATT estimation.
problem Estimating ATT in DiD designs with improved accuracy.
method Semiparametric Bayesian outcome regression and doubly robust adjustment.
result Bayesian methods provide strong finite-sample performance.
We propose a unified structural credit risk model incorporating both insolvency and illiquidity risks, in order to investigate how a firm's default probability depends on the liquidity risk associated with its financing structure. We assume the firm finances its risky assets by mainly issuing short- and long-term debt.…
Improved Thompson Sampling outperforms existing Bayesian optimization methods.
problem Thompson Sampling's performance in Bayesian optimization is suboptimal compared to other methods.
method Developed Stagger Thompson Sampler (STS), which more precisely samples the optimal arm with less computation.
result STS outperforms TS, PSS, and other acquisition methods in various optimization tasks.
DiD-BCF model improves causal inference in panel data with robust non-parametric methods.
problem Challenges in Difference-in-Differences (DiD) estimation, especially heterogeneous treatment effects and non-linearities.
method Difference-in-Differences Bayesian Causal Forest (DiD-BCF) with PTA-based reparameterization.
result DiD-BCF provides superior performance and uncovers significant heterogeneity in treatment effects.
Meta-learning is a tool that allows us to build sample-efficient learning systems. Here we show that, once meta-trained, LSTM Meta-Learners aren't just faster learners than their sample-inefficient deep learning (DL) and reinforcement learning (RL) brethren, but that they actually pursue fundamentally different learnin…
Generative AI boosts productivity and improves customer service quality.
problem Productivity and quality of customer support agents.
method Staggered introduction of a generative AI-based conversational assistant in customer support.
result AI increases productivity by 15% on average, with significant heterogeneity across workers.
Methods for prediction and tolerance intervals in non-normal models.
problem Constructing prediction and tolerance intervals for non-normal data.
method Two approaches: pivotal quantity approximation and confidence interval for mean.
result Intuitive, simple, efficient methods with proper operating characteristics.
The Web has enabled one of the most visible recent developments in education---the deployment of massive open online courses. With their global reach and often staggering enrollments, MOOCs have the potential to become a major new mechanism for learning. Despite this early promise, however, MOOCs are still relatively u…
Adapts bandit algorithms for online survival analysis under Cox PH model.
problem Online survival analysis challenges in a bandit framework.
method Adapts three bandit algorithms to balance exploration and exploitation.
result Demonstrates sublinear regret bounds and effective learning of treatment policies.
Efficient methods estimate concordance probability for big data.
problem Efficiently calculating concordance probability in large datasets.
method Proposes two estimation methods for discrete and continuous settings.
result Estimators are accurate and computationally efficient.
Taking inspiration from biological evolution, we explore the idea of "Can deep neural networks evolve naturally over successive generations into highly efficient deep neural networks?" by introducing the notion of synthesizing new highly efficient, yet powerful deep neural networks over successive generations via an ev…
Neural networks and deep learning are changing the way that artificial intelligence is being done. Efficiently choosing a suitable network architecture and fine-tune its hyper-parameters for a specific dataset is a time-consuming task given the staggering number of possible alternatives. In this paper, we address the p…
The last few years have seen a staggering number of empirical studies of the robustness of neural networks in a model of adversarial perturbations of their inputs. Most rely on an adversary which carries out local modifications within prescribed balls. None however has so far questioned the broader picture: how to fram…
This paper addresses the morphing of manifold-valued images based on the time discrete geodesic paths model of Berkels, Effland and Rumpf 2015. Although for our manifold-valued setting such an interpretation of the energy functional is not available so far, the model is interesting on its own. We prove the existence of…
Proposes an active RBI framework using Rényi information measures for more informed decision-making.
problem Optimal latent variable estimates in real-time settings with streaming noisy observations.
method Unified inference and query selection steps through Rényi entropy and α-divergence; new objective called Momentum for exploration.
result Analytically demonstrates superior performance compared to conventional methods like mutual information.
In this paper, we study the design and analysis of experiments conducted on a set of units over multiple time periods where the starting time of the treatment may vary by unit. The design problem involves selecting an initial treatment time for each unit in order to most precisely estimate both the instantaneous and cu…
Study compares 29 emulators across 60 test functions and 40 datasets.
problem Comparing the strengths and weaknesses of different emulators.
method Large-scale, fully reproducible comparison using R package duqling.
result Detailed empirical insights into emulator strengths and weaknesses.
Non-atomic arbitrage exploits price differences on Ethereum and other blockchains, accounting for over 10% of Ethereum's block value.
problem Price differences on decentralized exchanges and centralized exchanges lead to MEV.
method Analyzed non-atomic arbitrage on Ethereum's largest DEXes, identifying its prevalence and impact.
result More than 10% of Ethereum's block value is attributed to non-atomic arbitrage, involving over $132 billion.
Implementing large-scale information and communication technology (IT) projects carries large risks and easily might disrupt operations, waste taxpayers' money, and create negative publicity. Because of the high risks it is important that government leaders manage the attendant risks. We analysed a sample of 1,355 publ…
Proposes SSC for estimating counterfactual survival trajectories from observational data.
problem Challenges in estimating causal effects on time-to-event outcomes from observational data.
method Synthetic Survival Control (SSC) framework for estimating counterfactual hazard trajectories in panel data settings.
result SSC estimates counterfactual hazard trajectories as a weighted combination of observed trajectories from other units.
Proposes a multi-fidelity machine learning strategy integrating low-fidelity deterministic and high-fidelity Bayesian models.
problem Addressing the accuracy-efficiency trade-off in machine learning with scarce high-fidelity data.
method Integrates a non-probabilistic regression model for low-fidelity with a Bayesian model for high-fidelity, trained in a staggered scheme.
result Achieves comparable performance in mean and uncertainty estimation with reduced training time and effective mitigation of overfitting.
Proves equivalence of two types of boundaries in metric spaces.
problem Proving equivalence of two types of boundaries in metric spaces.
method Analyzes and compares contracting and κ-Morse boundaries. result Proves equivalence of 1-Morse boundary and contracting boundary as topological spaces.
Proves well-posedness for Einstein equations with specific boundary conditions.
problem Well-posedness of vacuum Einstein equations with twisted Dirichlet boundary conditions.
method Proves local-in-time well-posedness for the IBVP of the Einstein equations with specified conformal class and scalar densities.
result Proves well-posedness for the Einstein equations with twisted Dirichlet boundary conditions.
We introduce new boundary conditions for differential forms on symplectic manifolds with boundary. These boundary conditions, dependent on the symplectic structure, allows us to write down elliptic boundary value problems for both second-order and fourth-order symplectic Laplacians and establish Hodge theories for the …
Abstracts a construction of boundary triplets for self-adjoint elliptic problems.
problem Computing the index of families of self-adjoint elliptic boundary problems.
method Abstract axiomatic version of boundary triplets and their applications.
result Analytic proof of index theorem and computation of index differences.
The paper studies Ricci flow on manifolds with boundary, proving existence, uniqueness, and boundary conditions preservation.
problem Ricci flow on manifolds with boundary.
method Proving short-time existence and uniqueness of the solution, and showing boundary conditions preservation.
result The flow preserves natural boundary conditions under certain curvature conditions.
We study boundary value problems for first-order elliptic differential operators on manifolds with compact boundary. The adapted boundary operator need not be selfadjoint and the boundary condition need not be pseudo-local. We show the equivalence of various characterisations of elliptic boundary conditions and demonst…
Unique compact Fuchsian manifolds with convex boundary are determined by their boundary.
problem Identifying compact Fuchsian manifolds with convex boundaries.
method Proving uniqueness based on the induced path metric on the boundary.
result Compact Fuchsian manifolds with convex boundaries are uniquely determined by the induced path metric on the boundary.
Generalizes Bestvina's Z-boundaries to coarse Z-boundaries.
problem Establishing properties of Z-boundaries for groups. method Introducing a new concept of a 'coarse Z-boundary' and proving theorems about it. result Admitting a coarse Z-boundary is a pure quasi-isometry invariant. We introduce a new type of boundary for proper geodesic spaces, called the Morse boundary, that is constructed with rays that identify the "hyperbolic directions" in that space. This boundary is a quasi-isometry invariant and thus produces a well-defined boundary for any finitely generated group. In the case of a prope…
Study on quasi-Einstein manifolds with boundary estimates and inequalities.
problem Understanding the geometry of compact quasi-Einstein manifolds with boundary.
method Sharp boundary estimates and characterization theorems for quasi-Einstein manifolds.
result New geometric inequalities and boundary estimates for quasi-Einstein manifolds.
Foundations for free boundary Brakke flows established.
problem Analyzing free boundary flows through singularities
method Introducing unit-regular and cyclic free boundary flows, proving avoidance principle, and introducing inner and outer flows.
result General tools for analyzing free boundary flows through singularities.