Paper provides an example showing CD inequality doesn't imply CDE' inequality.
problem Relationship between CD inequality and CDE' inequality.
method Provides a counterexample.
result CD inequality does not imply CDE' inequality.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,341 papers · 148 categories
Trend · papers per month
48 results for “CDE inequalities”
We show a connection between the inequality and the inequality. In particular, we introduce a inequality as a slight generalization of which turns out to be equivalent to with appropriate choices of and . We use this to prove that the inequality implies the c…
The study estimates curvature on graphs with large girth.
problem Estimating curvature on graphs with large girth.
method Utilized CD and CDE inequalities.
result Curvature estimates on finite graphs with large girth.
We study some equivalent properties of the curvature-dimension conditions inequality on infinite, but locally finite graph. These equivalences are gradient estimate, Poincaré type inequalities and reverse Poincaré inequalities. And we also obtain one equivalent property of gradient estimate for a new notion o…
In this paper, we prove the equivalent of ultracontractive bound of heat semigroup or the uniform upper bound of the heat kernel with the Nash inequality, Log-Sobolev inequalities on graphs. We also show that under the assumption of volume growth and nonnegative curvature the Sobolev inequality, Nash inequa…
Paper derives Li-Yau inequality for unbounded Laplacian on graphs.
problem Deriving Li-Yau inequality for unbounded Laplacian on graphs.
method Assumption of curvature-dimension inequality and derivation of Li-Yau inequality.
result First results on Li-Yau inequality for unbounded Laplacian on graphs.
Noise regularization improves CDE models without overfitting.
problem Overfitting in neural network-based conditional density estimation.
method Noise regularization method that adds random perturbations to data.
result Noise regularization significantly outperforms other methods across various datasets and models.
Regression aims at estimating the conditional mean of output given input. However, regression is not informative enough if the conditional density is multimodal, heteroscedastic, and asymmetric. In such a case, estimating the conditional density itself is preferable, but conditional density estimation (CDE) is challeng…
Neural RDEs extend CDEs to irregular time series.
problem Modeling long irregular time series efficiently.
method Representing time series through log-signature and solving RDEs.
result Significant training speed-ups and improved model performance.
ABC-CDE tackles ABC challenges with high-dimensional data and limited simulations.
problem Challenges in ABC with high-dimensional data and costly simulations.
method ABC-CDE uses nonparametric conditional density estimation to address ABC challenges.
result ABC-CDE directly estimates and assesses the posterior based on an initial ABC sample.
By studying the heat semigroup, we prove Li-Yau type estimates for bounded and positive solutions of the heat equation on graphs, under the assumption of the curvature-dimension inequality , which can be consider as a notion of curvature for graphs. Furthermore, we derive that if a graph has non-negative cur…
The paper introduces tools for nonparametric conditional density estimation in astronomy.
problem Estimating photometric redshifts and likelihood-free cosmological inference with uncertainty quantification.
method Nonparametric conditional density estimation (CDE) tools in Python and R.
result Comprehensive statistical tools and software for CDE in astronomy.
Two new methods improve neural network's ability to estimate full conditional distributions.
problem Neural networks often only predict point values, missing full conditional distributions.
method Multiscale Nets and CDE Trend Filtering methods.
result Both methods complement each other, suitable for different data scenarios.
Framework combines random features with CDEs for efficient time-series learning.
problem Efficient training of time-series models with strong inductive bias.
method Random Fourier CDEs and Random Rough DEs using continuous-time reservoirs and log-ODE discretization.
result Unified perspective on random-feature reservoirs and path-signature theory.
Unsupervised clustering identifies meal patterns in T2DM self-monitoring data.
problem Identifying individual-level behavioral-clinical phenotypes in T2DM self-monitoring data.
method Hierarchical clustering of blood glucose and macronutrient consumption.
result All 9 gold standard patterns were re-discovered using HC, and most clusters were rated positively by CDEs.
AP-CDE uses NF to estimate high-dimensional conditional densities, improving interpretability.
problem Estimating conditional densities for high-dimensional responses like images.
method Extends NF neural networks to handle high-dimensional with a latent .
result Improves interpretation of latent components, especially .
Tabular foundation models outperform other methods in conditional density estimation across various datasets.
problem Estimating the full conditional distribution of a response given tabular covariates, especially in settings with heteroscedasticity, multimodality, or asymmetric uncertainty.
method Benchmarked three tabular foundation model variants (TabPFN and TabICL) against six CDE baselines on 39 real-world datasets.
result Tabular foundation models achieve the best CDE loss, log-likelihood, and CRPS across all sample sizes, outperforming other methods.
New method corrects ML for informative sampling in time-series treatment outcomes.
problem Informative sampling in irregularly observed data hinders accurate treatment outcome forecasting.
method Formalized as covariate shift, proposed inverse intensity-weighting framework, TESAR-CDE.
result TESAR-CDE effectively learns treatment outcomes under informative sampling.
DCDC calculates convergence rates for Markov chains using neural networks.
problem Computing precise convergence rates for Markov chains is hard.
method Developed a neural network-based algorithm (DCDC) to bound convergence rates in Wasserstein distance.
result Demonstrated effective convergence bounds for real-world Markov chains.
Fisher consistency improves class probability estimation under dataset shift.
problem Lack of Fisher consistency can lead to unreliable class probability estimates.
method Introduced Fisher consistency as a desirable property for class prior probability estimators.
result CDE-Iterate is not Fisher consistent and cannot be trusted for reliable estimates.
FlexCode converts high-dimensional regression to high-dimensional CDE.
problem Complex conditional distributions in high dimensions.
method Reformulates CDE as a non-parametric orthogonal series problem.
result Efficiently estimates conditional densities in high dimensions.
New fairness approach removes direct effects of unprivileged groups through causal regularization.
problem Ensuring fairness in machine learning models for unprivileged groups.
method Proposes a new fairness definition based on causal effects and develops regularizations to remove the impact of unprivileged groups on model outcomes.
result Demonstrates effectiveness of the approach on various datasets, reducing unfairness with minimal performance loss.
Neural CDEs correct errors in learned time-series models for better forecasting.
problem Error accumulation in multi-step forecasts of learned time-series models.
method Predictor-Corrector framework with a neural controlled differential equation.
result The proposed framework consistently improves forecasting performance across various models.
New method optimizes individualized decision rules for precision medicine.
problem Heterogeneous patient responses to treatments.
method Proposes a decision-rule based optimized covariates dependent equivalent (CDE) for individualized decision making.
result Numerical experiments show improved performance in estimating optimal IDRs.
On the Generalization and Approximation Capacities of Neural Controlled Differential Equationsstat.ML
NCDEs improve predictions for irregular time series data.
problem Theoretical understanding of NCDEs' performance and irregular time series effects.
method Combining CDE theory and neural net complexity measures.
result Generalization bound and detailed sampling and approximation bias analysis.
We use Gaussian processes to estimate conditional distributions with latent variables.
problem Challenging task of estimating conditional distributions with model complexity and overfitting trade-offs.
method Extend model input with latent variables and use Gaussian processes for mapping.
result Bayesian approach allows for modeling small datasets and applying to big data.
Continuous-Time Modeling of Counterfactual Outcomes Using Neural Controlled Differential Equationscs.LG
A new method models continuous-time counterfactual outcomes using neural controlled differential equations.
problem Estimating personalized healthcare outcomes over irregularly sampled data.
method Interpreting data as samples from a continuous-time process, modeling latent trajectory using controlled differential equations, and using adversarial training for time-dependent confounding.
result TE-CDE consistently outperforms existing approaches in irregularly sampled scenarios.
DDN models flexible free-form conditional distributions.
problem Difficulty in explicitly approximating arbitrary conditional distributions.
method Deconvolutional neural network framework for discretizing continuous domains.
result DDN outperforms other density-estimation methods on various tasks.
LADaR framework calibrates machine learning models for instance-wise predictions.
problem Challenges in assessing and calibrating predictive distributions for complex inputs.
method Local Amortized Diagnostics and Reshaping of Conditional Densities (LADaR) framework and algorithm.
result Achieves better instance-wise calibration than existing methods in galaxy distance estimation.
FlexCodeTS is a flexible time series density estimator.
problem Estimating conditional densities for time series data.
method Nonparametric conditional density estimator based on arbitrary regression methods.
result FlexCodeTS adapts its convergence rate based on the chosen regression method.
Regression, unlike classification, has lacked a comprehensive and effective approach to deal with cost-sensitive problems by the reuse (and not a re-training) of general regression models. In this paper, a wide variety of cost-sensitive problems in regression (such as bids, asymmetric losses and rejection rules) can be…
MSLs use parallelizable root-finding for efficient ODE and PDE solutions.
problem Efficiently solving initial value problems for ODEs and PDEs.
method Leveraging time-parallel methods, MSLs use parallelizable root-finding algorithms.
result MSLs offer significant speedups in NFEs and inference time.
Method learns dynamics from sparse, irregular feature data.
problem Learn system dynamics from sparse, irregularly sampled feature time series.
method Formulates as high-dimensional linear regression using signatures.
result Oracle bound on prediction error with explicit sampling dependencies.
Bayesian model selection improves multivariate causal discovery without restrictive assumptions.
problem Real-world causal discovery requires flexible assumptions to avoid restrictive model assumptions.
method Continuous relaxation of discrete model selection problem, using Causal Gaussian Process Conditional Density Estimator (CGP-CDE).
result Bayesian approach outperforms traditional methods in multivariate causal discovery.
Efficiently computes sparse signature coefficients using kernels.
problem Lack of efficient methods for sparse signature coefficients.
method Signature kernels and PDE-based methods.
result Sparse groups of signature coefficients can be isolated effectively.
The isoperimetric inequalitymath.DG
The isoperimetric inequality and related inequalities are explored.
problem Proving the isoperimetric inequality and related inequalities.
method Discussing classical and recent proofs.
result Various proofs of the isoperimetric inequality and Sobolev inequality.
New proof of Willmore inequality using geometric divergence inequality.
problem Proving the Willmore inequality for bounded domains.
method Using a parametric geometric inequality derived from a divergence form geometric differential inequality.
result New proofs of quantitative Willmore-type and weighted Minkowski inequalities.
Lorentz-Finsler geometry reveals new and old inequalities.
problem Finding new inequalities using Lorentz-Finsler geometry.
method Applying reverse Cauchy-Schwarz and reverse triangle inequalities in Lorentz-Finsler geometry.
result Proved new and refined inequalities, including refinements of Aczél's inequality.
The paper derives new inequalities on manifolds and applies them to convex hypersurfaces.
problem Deriving new inequalities on manifolds and convex hypersurfaces.
method Using Fourier theory and geometric implications of Poincare-type inequalities.
result Sharp Minkowski-type inequalities, including stability and Alexandrov-Fenchel inequalities.
The paper proves inequalities on Finsler manifolds under Ricci curvature bounds.
problem Proving -Sobolev and Nash inequalities on Finsler metric measure manifolds.
method Global -Poincaré inequality, -Sobolev inequality, Nash inequality derivation.
result Established global optimal -Sobolev inequality with a sharp constant.
New inequality on sphere generalizes circle inequality.
problem Generalizing circle inequality to sphere.
method Develops a new inequality on the sphere that incorporates mass center deviation.
result Improves Aubin's inequality and Onofri's inequality.
Paper proves anisotropic Minkowski inequality and related inequalities.
problem Proving anisotropic Minkowski inequality and related inequalities.
method Utilizes a nonlinear potential theoretic approach.
result Sharp anisotropic Minkowski inequality and related inequalities proved.
Explains geometric inequalities for minimal hypersurfaces.
problem Geometric inequalities for minimal hypersurfaces.
method Expository discussion of known inequalities.
result Discussion of classical inequalities for minimal hypersurfaces.
The paper finds new inequalities for convex polygons.
problem Finding precise inequalities for convex polygons.
method Analytic isoperimetric inequalities based on Schur convex functions, followed by Bonnesen-style and inverse Bonnesen-style inequalities.
result Sharp discrete isoperimetric inequalities for planar convex polygons.
Study shows household inequality accounts for 30% of total global income inequality.
problem Intra-household inequality is often overlooked in studies of income inequality.
method Used LIS micro data to analyze inequality trends in 1973-2013 across multiple countries.
result At least 30% of total global income inequality is due to intra-household inequality.
The study improves Bochner inequality on Finsler manifolds to derive important inequalities.
problem Improving Bochner inequality on Finsler manifolds to derive new inequalities.
method Using improved Bochner inequality and its integrated form, the study derives a sharp Poincaré-Lichnerowicz inequality, a new proof for logarithmic Sobolev inequality, and an estimate of geodesic ball volumes.
result Derivation of new inequalities and estimates on Finsler manifolds.
The paper proves various inequalities on gradient shrinking Ricci solitons.
problem Understanding geometric inequalities on gradient shrinking Ricci solitons.
method Proving multiple inequalities equivalent on complete gradient shrinking Ricci solitons.
result Various inequalities (Sobolev, logarithmic Sobolev, Schrödinger, etc.) are equivalent on gradient shrinking Ricci solitons.
Sharp inequality found on three-balls for fourth order Sobolev traces.
problem Fourth order Sobolev trace inequality on three-balls.
method Established through equivalence to a third order Sobolev inequality on two-spheres.
result Sharp fourth order Sobolev trace inequality on three-balls.