The paper proposes a new model to better estimate demand from censored data.
problem Challenges in inferring true demand from aggregate, censored data.
method Combines Tobit likelihood with graph diffusion process in Gaussian Processes.
result The new model produces more accurate out-of-sample predictions.
Modeling shared mobility demand considering supply limitations.
problem Inaccurate demand predictions due to limited supply.
method Censored Gaussian Processes for demand modeling.
result Taking supply limitations into account improves demand predictions.
Optimistic pricing algorithm handles online dynamic pricing with censored demand.
problem Online dynamic pricing with censoring of potential demand.
method Optimistic estimates of derivatives for pricing algorithm.
result Achieves i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) optimal regret against adversarial inventory series. Study compares machine learning and econometric models for demand prediction with and without accounting for sales censorship.
problem Predicting demand based on sales data and correcting bias in estimates of demand parameters.
method Constructed two ensemble models: one accounting for sales censorship and one not. Used censored quantile regression and various machine learning models.
result Machine learning models with censorship accounting provide similar bias-corrected demand sensitivity estimates as econometric models.
Study on newsvendor problem with censored data, showing how much information is lost.
problem Minimizing costs in a newsvendor problem with limited historical demand data.
method Distributionally robust optimization framework, evaluating policies based on worst-case regret.
result Characterization of information loss due to demand censoring and development of a robust algorithm.
Study optimal pricing and inventory control in dynamic settings with censored demand.
problem Optimal pricing and inventory control in dynamic settings with censored demand.
method Approximate optimal policy via high-order MDP, propose novel algorithms for solving Bellman equations.
result Established finite-sample regret bounds and demonstrated efficacy through numerical experiments.
New policy minimizes cost in dynamic inventory management with censored data.
problem Minimizing cumulative cost in inventory management with censored demand data.
method Developed a randomized policy, Exponentially Weighted Forecaster, with a cost estimator.
result Achieved optimal regret scaling with respect to key primitives.
New framework forecasts both supply and demand in rental markets.
problem Booking models ignore supply, leading to regime-specific ceilings.
method Three-part coupling framework (behavioral, informational, intervention).
result Booking models learn a regime-specific ceiling and become fragile.
The paper proposes a new method to forecast winning prices in real-time bidding.
problem Accurately forecasting winning prices in real-time bidding with limited data.
method The paper introduces a heteroscedastic fully parametric censored regression approach and a mixture density censored network.
result The proposed method significantly improves winning price forecasting compared to existing methods.
A new method for inventory control using in-context learning and generative models.
problem Inventory control with decision-dependent censoring, focusing on the censored newsvendor problem.
method In-context generative posterior sampling (ICGPS) combining modern generative models and in-context autoregressive generation.
result ICGPS achieves sublinear Bayesian regret for the censored newsvendor problem, outperforming existing methods.
Study on inventory control with changing demand, proposing adaptive algorithms.
problem Inventory control with non-stationary demand distributions.
method Adaptive online algorithms optimizing base-stock policies.
result Sharp separation in adaptability across different inventory models.
Linear regression is arguably the most prominent among statistical inference methods, popular both for its simplicity as well as its broad applicability. On par with data-intensive applications, the sheer size of linear regression problems creates an ever growing demand for quick and cost efficient solvers. Fortunately…
Optimal vehicle repositioning policy found for shared mobility services.
problem Matching fixed supply with spatial customer demand under uncertain and correlated demand.
method Base-stock repositioning policy, asymptotic optimality, regret analysis, adaptive repositioning algorithm.
result Surrogate Optimization and Adaptive Repositioning algorithm achieves optimal regret of O ( n 2.5 T ) O(n^{2.5} \sqrt{T}) O ( n 2.5 T ) . Models for predicting the risk of cardiovascular events based on individual patient characteristics are important tools for managing patient care. Most current and commonly used risk prediction models have been built from carefully selected epidemiological cohorts. However, the homogeneity and limited size of such coho…
WTNN models survival with neural networks for maintenance data.
problem Modeling survival with limited proxy data and censored observations.
method WTNN integrates neural networks with Weibull distribution for time-dependent covariates.
result WTNN produces robust survival predictions improving on existing methods.
RNN models improve demand forecasting for diverse products.
problem Accurately predicting purchase patterns of popular products with sparse and heterogeneous data.
method Survival analysis with Recurrent Neural Networks (RNN) to model inter-arrival times and partially observed data.
result RNN-based approach achieves substantial improvements over traditional methods.
This paper addresses issues with the Brier score in administrative censoring scenarios.
problem Problems with the Brier score in administrative censoring scenarios.
method Proposes an alternative Brier score for administratively censored data.
result The administrative Brier score is valid even when censoring times can be identified from covariates.
High throughput genetic sequencing arrays with thousands of measurements per sample and a great amount of related censored clinical data have increased demanding need for better measurement specific model selection. In this paper we establish strong oracle properties of nonconcave penalized methods for nonpolynomial (N…
A new boosting model handles dependent censoring in time-to-event data.
problem Independent censoring assumption leads to biased predictions in time-to-event analysis.
method Clayton-boost, a boosting approach using Clayton copula.
result Clayton-boost outperforms other methods in handling dependent censoring.
Improved regret bounds for inventory management with unknown demand distribution.
problem Stochastic inventory control problem with censored demands and positive lead times.
method Utilized convexity properties and derived bias bounds to connect to stochastic convex bandit optimization.
result Regret bound of i l d e O ( L T + D ) ilde{O}(L\sqrt{T}+D) i l d e O ( L T + D ) for the inventory control problem. Develops a method to estimate quantiles in censored data using random forests.
problem Inability of random forests to handle censored data, leading to poor predictive performance.
method Censored Quantile Regression Forests (CQRF) based on local adaptive random forests.
result Consistent estimation of quantiles without parametric modeling assumptions.
Develops a method to estimate quantiles in censored data using random forests.
problem Inability of random forests to handle randomly censored observations.
method Regression adjustment for quantile regression models based on a new estimating equation.
result Consistent estimation of quantiles without parametric modeling assumptions.
This paper introduces a multi-output Gaussian process for censored data.
problem Modeling bias in censored data using correlations between multiple outputs.
method Heteroscedastic multi-output Gaussian process with input-dependent noise and variational inference.
result The model better estimates the true process under complex censoring dynamics.
DAERNN models censored data using neural networks with data augmentation.
problem Handling censored data in expectile regression.
method Data augmentation based Expectile Regression Neural Networks (ERNNs).
result DAERNN outperforms existing censored ERNNs methods and achieves comparable predictive performance to fully observed data.
Study improves risk evaluation timing with right-censored reporting delays.
problem Improving risk evaluation under short observation windows due to administrative censoring.
method Jointly models parametric hazards for event and reporting processes, uses Monte Carlo expectation-maximization algorithm, and proposes transfer-learning procedure.
result Improves accuracy of timely risk evaluation under administrative censoring.
optHSIC tests independence between covariates and censored lifetimes using optimal transport.
problem Testing independence between a covariate and right-censored lifetimes.
method optHSIC uses optimal transport to transform censored data into uncensored data, then applies a permutation test with a kernel-based dependence measure.
result optHSIC has power against a wider class of alternatives than Cox regression and maintains type 1 error control even when censoring depends on the covariate.
New metric reduces estimation error in survival model evaluation.
problem Dependent censoring complicates survival model evaluation.
method Dependent Brier score based on Archimedean copula and Copula-Graphic estimator.
result Reduces estimation error by 12-16% on average.
New method generates synthetic survival data by conditioning on event times and censoring indicators.
problem Generating accurate synthetic survival data with censored event times.
method Conditioning covariates on event times and censoring indicators using existing tabular data generation models.
result Our method consistently outperforms baselines and improves survival model performance.
The paper benchmarks OS with RCTs, accounting for right-censoring.
problem Benchmarking observational studies with experimental data under censoring.
method Two cases: independent and dependent censoring. Censoring-doubly-robust signal for CATE.
result Effectiveness of censoring-aware tests verified via experiments and real data.
Study proposes a machine learning method for bid shading in first-price auctions.
problem Maintaining strategy equilibrium in first-price auctions.
method Machine learning approach to model optimal bid shading.
result Demonstrates superiority and robustness of new approach across various metrics.
Efficient neural Bayes estimators for censored peaks-over-threshold models improve inference speed and accuracy.
problem Computational burden in inference with spatial extremal dependence models due to intractable or censored likelihoods.
method Developed neural Bayes estimators using data augmentation techniques to encode censoring information.
result Significant gains in computational and statistical efficiency compared to traditional methods.
New methods improve off-policy evaluation for survival outcomes with censoring.
problem Systematic underestimation of policy performance due to censoring bias in survival outcomes.
method Proposes IPCW-IPS and IPCW-DR to handle censoring bias in survival outcomes.
result The proposed methods are unbiased and achieve double robustness.
Bayesian active learning method improved for censored regression data.
problem Challenges in estimating BALD for censored regression data.
method Derived entropy and mutual information for censored distributions, developed C \mathcal{C} C -BALD objective, proposed novel modelling approach. result Demonstrated C \mathcal{C} C -BALD outperforms other methods in censored regression. Deep network optimizes ad bidding for first-price auctions.
problem Optimizing bid prices for first-price auctions in online advertising.
method Introduced a deep distribution network for optimal bidding.
result Algorithm outperforms previous methods in terms of surplus and eCPX metrics.
Survival forests estimate treatment effects with censored data.
problem Estimating treatment effects in survival analysis with censored data.
method Causal survival forests using orthogonal estimating equations.
result Survival forests perform well relative to baselines in treatment effect estimation.
Study learns Gaussian mixtures from censored data.
problem Learning Gaussian mixtures with incomplete data.
method Proposes an algorithm to estimate weights and means with minimal samples.
result Achieves accurate estimation with very few samples.
New estimator for survival function with missing not at random censoring indicators.
problem Estimating survival function with missing not at random censoring indicators.
method Proposes a new estimator based on a conditional copula model for the missingness mechanism.
result Provides a new method for estimating conditional survival function with MNAR censoring indicators.
Deep learning improves quantile regression for censored survival data.
problem Predicting nonlinear patterns in censored survival data.
method Neural network with adjusted check function for inverse censoring distribution.
result Deep learning outperforms traditional quantile regression methods in prediction accuracy.
Boosting methods for interval-censored data improve predictive accuracy in survival analysis.
problem Handling interval-censored data in survival analysis and time-to-event studies.
method Nonparametric boosting methods using censoring unbiased transformations and functional gradient descent.
result Effective boosting methods for regression and classification with interval-censored data, offering robust performance.
Develops adaptive framework for estimating survival effects with censoring.
problem Estimating causal effects in survival data with censoring.
method Derives semiparametric efficiency bound, proposes efficiency-optimal allocation policy, and develops Adaptive Survival Estimator (ASE).
result ASE achieves asymptotic normality via martingale central limit theorem and demonstrates efficiency gains over uniform randomization.
New method handles dependent censoring without specifying copula.
problem Dependent censoring in survival analysis.
method Deep learning with flexible copula estimation.
result Significant reduction in survival estimation bias.
The paper forecasts corporate distress using a novel MIDAS logistic regression method.
problem Forecasting corporate distress with right-censored data, high-dimensional predictors, and mixed-frequency data.
method The paper introduces a novel high-dimensional censored MIDAS logistic regression method that handles censoring through inverse probability weighting and employs a sparse-group penalty for mixed-frequency predictors.
result The method achieves accurate estimation and superior performance in predicting financial distress of Chinese-listed firms.
GCQRF predicts survival quantiles without linearity assumptions.
problem Survival analysis with right censoring and nonlinearity.
method Global Censored Quantile Random Forest (GCQRF) for complex relationships.
result GCQRF outperforms existing methods in predictive accuracy.
Develops HCQRF for estimating heterogeneous treatment effects with censored data.
problem Estimating heterogeneous treatment effects on censored responses with high-dimensional variables.
method Hybrid Censored Quantile Regression Forest (HCQRF) combining random forests and censored quantile regression.
result Demonstrates the effectiveness and stability of HCQRF through simulation studies and real-world application.
In this paper, we analyze energy-harvesting adaptive diffusion networks for a distributed estimation problem. In order to wisely manage the available energy resources, we propose a scheme where a censoring algorithm is jointly applied over the diffusion strategy. An energy-aware variation of a diffusion algorithm is us…
MISTR improves HTE estimation in survival data with heavy censoring and instrumental variables.
problem Estimating HTE in survival data with censoring and unobserved confounders.
method MISTR uses recursively imputed survival trees to handle censoring and instrumental variables.
result MISTR outperforms existing methods under heavy censoring and instrumental variable settings.
Paper addresses generalization error bounds for learning with censored feedback.
problem Impact of censored feedback on generalization error bounds.
method Derives an extension of DKW inequality for non-IID data due to censored feedback and uses it to bound generalization error.
result Existing generalization error bounds fail to account for censored feedback, necessitating new bounds.
The paper addresses bias in survival analysis due to informative censoring.
problem Bias in treatment effect estimates due to informative censoring in survival analysis.
method Assumption-lean framework using partial identification to derive bounds on CATE.
result Proposes a meta-learner, SurvB-learner, to estimate bounds on CATE.