Paper uses stats to predict treatment choice based on illness probability.
problem Improving treatment decision-making in personalized medicine.
method Statistical decision theory with maximum regret evaluation.
result Estimates illness probability for better treatment choice.
The majority of traditional classification ru les minimizing the expected probability of error (0-1 loss) are inappropriate if the class probability distributions are ill-defined or impossible to estimate. We argue that in such cases class domains should be used instead of class distributions or densities to construct …
Method determines credit transition matrix from cumulative default probabilities.
problem Quantifying changes in bond credit ratings.
method Setup an ill-posed, linear inverse problem with entropy minimization.
result Method successfully determines CTM from cumulative default probabilities.
New method speeds up optimization over probability measures.
problem High computational overhead in optimizing probability measures.
method Randomized coordinate descent on Wasserstein space.
result Significant speedups over full-gradient methods.
The paper develops SGD for estimating operators from data.
problem Estimating operators from data in infinite-dimensional spaces.
method Regularized SGD with operator-valued kernels.
result Near-optimal convergence rates for prediction and estimation.
In tropical regions, populations continue to suffer morbidity and mortality from malaria and arboviral diseases. In Kedougou (Senegal), these illnesses are all endemic due to the climate and its geographical position. The co-circulation of malaria parasites and arboviruses can explain the observation of coinfected case…
The estimation of probabilities of network edges from the observed adjacency matrix has important applications to predicting missing links and network denoising. It has usually been addressed by estimating the graphon, a function that determines the matrix of edge probabilities, but this is ill-defined without strong a…
We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs. Several applications to linear and polynomial equation solving show that the estima…
We study the ruin problem over a risk process described by a discrete-time Markov model. In contrast to previous studies that focused on the asymptotic behaviour of ruin probabilities for large values of the initial capital, we provide a new technique to compute the quantity of interest for any initial value, and with …
The paper addresses ill-conditioning in large spatial data, proposing solutions for prediction and likelihood estimation.
problem Ill-conditioning of the kernel matrix in large spatial data sets.
method Introduction of various optimality criteria and solutions for managing large spatial data.
result Solutions for managing large spatial data, addressing ill-conditioning and improving prediction and likelihood estimation.
Riemannian flows model curved spaces better.
problem Normalizing flows misspecified on curved spaces.
method Riemannian continuous normalizing flows using ODE solutions.
result Improves modeling on spheres, torii, and hyperbolic spaces.
This paper formulates and studies a general continuous-time behavioral portfolio selection model under Kahneman and Tversky's (cumulative) prospect theory, featuring S-shaped utility (value) functions and probability distortions. Unlike the conventional expected utility maximization model, such a behavioral model could…
AI system predicts acute critical illness from EHRs with explainability.
problem Lack of clinical interpretability in AI predictions for acute critical illness.
method Developed an explainable AI early warning score (xAI-EWS) system.
result System provides clinicians with insights into EHR data explaining predictions.
MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.
problem Solving ill-posed linear inverse problems in Bayesian settings.
method Exploiting SGM structure, defining a sequence of intermediate problems, and using SMC methods.
result MCGDiff outperforms competing methods in Bayesian ill-posed inverse problems.
Scalable method completes ill-conditioned matrices from few samples.
problem Matrix completion from few samples for ill-conditioned matrices.
method Iterative algorithm combining IRLS, smoothing Newton, and proximal gradient methods.
result Local quadratic convergence rate and well-conditioned linear systems.
Paper optimizes estimation of quadratic functionals in nonparametric IV models.
problem Optimal estimation of a nonlinear functional in ill-posed inverse regression.
method Adaptive, minimax estimation using leave-one-out, sieve NPIV estimator with data-driven sieve dimension selection.
result Adaptive estimator achieves minimax optimal rate in various ill-posed cases.
Improves numerical solution of ill-conditioned linear systems for machine learning.
problem Wastefulness and instability in solving ill-conditioned linear systems.
method autonugget combines Richardson extrapolation to determine the solution of the ill-conditioned system, improving accuracy over a single nugget.
result Improves accuracy of numerical solution of ill-conditioned linear systems.
Paper explores challenges in training PINNs and loss landscape effects.
problem Challenges in training Physics-Informed Neural Networks (PINNs) due to loss landscape issues.
method Examined gradient-based optimizers Adam, L-BFGS, and their combination Adam+L-BFGS, and introduced NysNewton-CG (NNCG).
result Adam+L-BFGS outperforms other optimizers, and NysNewton-CG significantly improves PINN performance.
Study rates of convergence for approximate solutions to linear ill-posed problems in Hilbert scales.
problem Linear ill-posed inverse problems with noisy data.
method Approximate reconstructions from random noisy data using regularization schemes in Hilbert scale.
result Explicitly established error bounds for smooth regression functions.
Paper shows linear convergence of ISTA and FISTA for ill-conditioned images.
problem Solving linear inverse problems with sparse representation in signal and image processing.
method Revisits iterative shrinkage-thresholding algorithms (ISTA) and improves their convergence properties.
result Linear convergence of ISTA and FISTA for strongly convex smooth parts, even in ill-conditioned cases.
SAPPHIRE tackles ill-conditioned rERM problems with faster convergence.
problem Ill-conditioned objectives and non-smooth regularizers in rERM.
method Sketch-based preconditioning and scaled proximal mapping.
result Achieves condition-number-free linear convergence.
The goal of the inverse reinforcement learning (IRL) problem is to recover the reward functions from expert demonstrations. However, the IRL problem like any ill-posed inverse problem suffers the congenital defect that the policy may be optimal for many reward functions, and expert demonstrations may be optimal for man…
New framework assesses regularization norms in ill-posed problems, revealing L2 instability and proposing adaptive fractional RKHS solutions.
problem Comparative analysis of regularization norms in ill-posed problems.
method Small noise analysis framework for Tikhonov and RKHS regularizations.
result Optimal convergence rates achieved with adaptive fractional RKHS, but hyper-parameters decay too fast.
A method learns representations for conditional moment models with controlled ill-posedness.
problem Efficient estimation of nonparametric conditional moment models with flexible models is challenging.
method Proposes a procedure that learns spectral representations with controlled measures of ill-posedness.
result The proposed method can efficiently estimate representations from data and is L2 consistent.
Perturbation theory improves nonparametric instrumental variable estimation accuracy.
problem Improving nonparametric instrumental variable estimation accuracy in high-dimensional settings.
method Perturbative approach based on physics perturbation theory, extending kernel ridge methods with higher-order corrections.
result First-order perturbative corrections reduce prediction error by up to 99% in high-dimensional ill-defined cases.
New framework uses score-based priors to solve ill-conditioned polynomial equations, improving signal recovery from noisy data.
problem Recovering signals from low-order moments in inverse problems, especially ill-conditioned polynomial equations.
method Integrates score-based diffusion priors with moment-based estimators to regularize and solve nonlinear inverse problems.
result Diffusion priors improve recovery from third-order moments and make super-resolution MTD feasible.
In the present paper we consider application of overcomplete dictionaries to solution of general ill-posed linear inverse problems. In the context of regression problems, there has been enormous amount of effort to recover an unknown function using such dictionaries. One of the most popular methods, lasso and its versi…
The Fredholm integral equation of the first kind improves solutions for ill-posed supervised learning problems with limited data.
problem Ill-posed supervised learning problems with insufficient data.
method Using the Fredholm integral equation of the first kind (FIFK) with semi-supervised assumptions and MSDF methods.
result Improved accuracy and stability in solutions for ill-posed problems.
This paper analyzes adaptive gradient algorithms for better performance in ill-conditioned problems.
problem Poor performance of standard stochastic gradient algorithms in ill-conditioned problems.
method Non-asymptotic analysis of adaptive gradient algorithms (Adagrad and Stochastic Newton) for strongly convex objectives.
result Theoretical analysis and adaptation to practical applications like linear regression and regularized GLM.
Personalized predictive medicine necessitates the modeling of patient illness and care processes, which inherently have long-term temporal dependencies. Healthcare observations, recorded in electronic medical records, are episodic and irregular in time. We introduce DeepCare, an end-to-end deep dynamic neural network t…
Improved convergence for overparameterized low-rank matrix sensing.
problem Overparameterized low-rank matrix sensing with unknown rank and ill-conditioning.
method ScaledGD(λ) - preconditioned gradient descent method. result ScaledGD(λ) converges at a constant linear rate after a logarithmic number of iterations. Study stability of contingent claim solutions under probabilistic perturbations.
problem Stability of solutions to discrete-time contingent-claim problems under uncertainty.
method Use Rockafellian perturbations to analyze stability of solutions.
result Establishes convergence of dual problems and shadow prices.
IAGAN method improves medical image reconstruction by incorporating adaptive GAN priors.
problem Reconstructing high-fidelity medical images from incomplete data.
method Image-adaptive GAN-based reconstruction method (IAGAN).
result IAGAN can recover fine structures relevant for medical diagnosis.
Bayesian optimisation framework considers only variable orderings to handle ill-conditioned objectives.
problem Bayesian optimisation fails with ill-conditioned or discontinuous objectives.
method Proposes a new framework that considers only the ordering of variables in input and output spaces, fitting a Gaussian process in a latent space.
result Proves optimal performance under the measure of regret for an optimistic strategy in the latent space.
Paper introduces a Gibbs sampler for Bayesian inversion of ill-posed problems.
problem Bayesian inversion of ill-posed problems with linear transformation and additive noise.
method Gibbs algorithm based on prior diffusion model.
result Gibbs algorithm offers a guarantee of convergence in a specific situation.
Traditional methods for assessing illness severity and predicting in-hospital mortality among critically ill patients require time-consuming, error-prone calculations using static variable thresholds. These methods do not capitalize on the emerging availability of streaming electronic health record data or capture time…
Aleatoric uncertainty is an intrinsic property of ill-posed inverse and imaging problems. Its quantification is vital for assessing the reliability of relevant point estimates. In this paper, we propose an efficient framework for quantifying aleatoric uncertainty for deep residual learning and showcase its significant …
Researchers develop methods to recover agent behavior from sparse data using Gaussian processes.
problem Recovering agent behavior from limited, noisy data in potential mean field games.
method Two Gaussian process-based frameworks: inf-sup formulation and bilevel approach.
result Surrogate MFG models can accurately reproduce observed data, even when prior information is limited.
Scaled gradient descent improves matrix recovery for ill-conditioned matrices with optimal sampling complexity.
problem Recovering low-rank matrices from limited measurements efficiently and accurately.
method Scaled gradient descent (ScaledGD) with optimal sample complexity and improved iteration complexity.
result ScaledGD achieves optimal sample complexity and improved iteration complexity for ill-conditioned matrices.
Causal Interaction Trees identify treatment subgroup effects in observational data.
problem Identifying subgroups with enhanced treatment effects in observational studies.
method Extending Classification and Regression Trees with subgroup-specific treatment effect estimators.
result The proposed algorithms enhance treatment effect heterogeneity in subgroups.
Active learning selects optimal measurement times for inferring continuous paths from sparse data.
problem Inferring continuous probability paths from sparse snapshots in high-fidelity domains like single-cell biology.
method Extends active experimentation to the space of measures using Linearized Optimal Transport (LOT) for probabilistic surrogate modeling.
result Empirical results show that the proposed strategy outperforms uncertainty-agnostic baselines.
Aggregated variables can mask causal effects, turning unconfounded into confounded relations.
problem Aggregated variables can mask causal effects, leading to paradoxical confounding.
method Analysis of how aggregated variables can change the definition of causality and the feasibility of causal relations.
result Macro causal relations are defined by micro states, not just aggregated variables.
More than two thirds of mental health problems have their onset during childhood or adolescence. Identifying children at risk for mental illness later in life and predicting the type of illness is not easy. We set out to develop a platform to define subtypes of childhood social-emotional development using longitudinal,…
Score-based models improve diffuse optical tomography accuracy.
problem Improving accuracy in diffuse optical tomography with uncertainty quantification.
method Score-based diffusion models with a mixed score function to prevent overfitting.
result Data-driven prior distribution results in posterior samples with low variance and centred around the ground truth.
New methods for estimating complex causal effects in econometrics.
problem Estimating causal parameters in short panel data models using nested nonparametric instrumental variable regression.
method Introducing techniques to limit ill-posedness in nested NPIV, providing explicit mean square rates and efficient inference.
result Explicit mean square rates for nested NPIV and efficient inference for causal parameters.
ScaledGD accelerates ill-conditioned low-rank estimation.
problem Slow convergence of gradient descent in ill-conditioned problems.
method Scaled gradient descent (ScaledGD) with preconditioning.
result Linear convergence rate independent of condition number.
Autoencoders identify brain networks linked to stress and genotype.
problem Designing effective brain stimulation protocols for mental illnesses.
method Supervised autoencoders to model multi-region brain activity.
result Autoencoders reveal a stress-related brain network associated with a bipolar disorder genotype.
Early stopping methods reduce unnecessary reasoning steps in LLMs by monitoring uncertainty signals.
problem LLMs sometimes generate unnecessary reasoning steps, especially under uncertainty.
method Statistically principled early stopping methods that monitor uncertainty signals during generation.
result Uncertainty-aware early stopping improves efficiency and reliability in LLM reasoning, especially in math reasoning.