Generative model for morphological continuum of normal and pathological states.
problem Identifying trends and features that separate normality and pathology in biomedical images.
method Wasserstein Auto-encoder with HSIC regularization for latent features.
result Model generates a continuum of morphological changes corresponding to side information.
Proposes using continuum percolation to analyze data manifolds and improve generative models.
problem Disentangling geometric support from probability distributions in high-dimensional data.
method Establishes a correspondence between topological phase transitions of random geometric graphs and data manifolds, using Percolation Shift metric.
result Demonstrates that Percolation Shift metric captures structural pathologies like mode collapse and guides training to prevent manifold shrinkage and improve fidelity.
Localization of chest pathologies in chest X-ray images is a challenging task because of their varying sizes and appearances. We propose a novel weakly supervised method to localize chest pathologies using class aware deep multiscale feature learning. Our method leverages intermediate feature maps from CNN layers at di…
This study investigates how much knowledge from natural images can be transferred to pathology images.
problem Quantifying how much knowledge from natural images can be transferred to pathology images.
method Proposes a framework to quantify knowledge gain by a particular layer, conducts empirical investigation in pathology image centered transfer learning.
result Early layers of deep models can transfer knowledge to pathology image classification tasks.
Study classifies pathology reports using TF-IDF features and machine learning.
problem Classifying pathology reports for cancer surveillance and diagnostic workflow.
method Extracted TF-IDF features from pathology reports and classified them using SVM, XGBoost, and Logistic Regression.
result XGBoost achieved 92% accuracy in classifying pathology reports.
Smooth knots can be embedded into a specific Menger continuum.
problem Embedding smooth knots into a specific type of continuum.
method Explicit construction using cubical models and self-similarity of the Menger continuum.
result Every smooth knot can be isotoped into the Menger continuum.
This paper characterizes VAE training pathologies and their effects on tasks.
problem Characterizing VAE training pathologies and their impact on downstream tasks.
method Concretely characterizing conditions for VAE training pathologies and their connection to specific downstream tasks.
result Connects VAE training pathologies to specific downstream tasks like learning compressed and disentangled representations, adversarial robustness, and semi-supervised learning.
We prove the following result announced in Todorov and Valov: Any homogeneous, metric ANR-continuum is a VGn-continuum provided dimGX=n≥1 and Hˇn(X;G)=0, where G is a principal ideal domain. This implies that any homogeneous n-dimensional metric ANR-continuum with $\check{H}^n(X;G)\neq…
We introduce the continuum self-similar tree (CSST) and characterize it topologically. We apply this to answer a question of Curien about the topology of the continuum random tree (CRT). We also give a topological characterization of other trees with branch points of finite or infinite valences.
Batch normalization in the last layer reduces sharpness in wide neural networks.
problem Pathological sharpness in wide neural networks.
method Quantifying the geometry of the parameter space using Fisher information matrix and analyzing deep neural networks with random initialization.
result Batch normalization in the last layer significantly decreases pathological sharpness under specific conditions.
The paper identifies conditions for trend reversal in classification tasks.
problem Trend reversal in classification scores and dataset values.
method Algebraic conditions and numerical results for ridge regression.
result Existence of pathological regularization regimes for certain dataset conditions.
SAPSAM trains CNNs on lung CTs with binary labels, improving CPA detection and localization.
problem Chronic Pulmonary Aspergillosis (CPA) detection and localization on CT scans using binary labels.
method Binary labels, average intensity projections, 2D RGB-like images, hierarchical CNN architectures.
result High classification accuracy, precise localization, predictive power of 2-year survival.
KL-regularized RL from expert demos can lead to slow, unstable learning.
problem Pathological training dynamics in KL-regularized RL from expert demonstrations.
method Empirical analysis and non-parametric behavioral reference policies.
result KL-regularized RL can be significantly improved by using non-parametric behavioral policies.
This work examines robust MCMC for pathological distributions.
problem Pathological behavior in target distributions affects MCMC efficiency.
method Reviewing and proposing remedies for roughness and flatness in MCMC.
result Robust MCMC algorithms can perform well even in challenging conditions.
Paper develops a BERT-based classifier to reduce pathology report annotation workload.
problem Manual annotation of pathology reports is labor-intensive and time-consuming.
method Developed an automatic text classifier using BERT and introduced a human-centric metric to identify low-confidence cases.
result The model reduces manual annotation workload by 80% to 98%.
We introduce a novel approach, requiring only mild assumptions, for the characterization of deep neural networks at initialization. Our approach applies both to fully-connected and convolutional networks and easily incorporates batch normalization and skip-connections. Our key insight is to consider the evolution with …
The paper presents algorithms for diagnosing Pathological Myopia and detecting retinal structures.
problem Diagnosing Pathological Myopia and detecting retinal structures in fundus images.
method The approach uses Deep Learning techniques, including transfer learning with Xception and YOLO architecture.
result The method has shown satisfactory results in the Pathologic Myopia Challenge.
Continuum Dropout improves neural differential equations by preventing overfitting.
problem Overfitting in Neural Differential Equations (NDEs).
method Introduces Continuum Dropout, a regularization technique based on alternating renewal processes.
result Continuum Dropout outperforms existing methods in various tasks, improving generalization and uncertainty quantification.
Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…
Overview of manifolds of mappings for continuum mechanics.
problem Understanding smooth mappings between manifolds.
method Presentation of manifolds of mappings and their properties.
result Smooth convenient manifold C∞(M,N) of mappings between manifolds. Derives continuum model from discrete ε-graphs with connectivity functional.
problem Modeling diffusion in networks with varying connectivity.
method Energy-based continuum limit derivation, neural-network reconstruction of connectivity.
result Error between discrete and continuum energies is O(ε), valid even with fluctuations. An important question that discrete approaches to quantum gravity must address is how continuum features of spacetime can be recovered from the discrete substructure. Here, we examine this question within the causal set approach to quantum gravity, where the substructure replacing the spacetime continuum is a locally f…
Generalizes Alexandroff's Vn-continua to cohomological dimensions.
problem Extending Alexandroff's concept of Vn-continua to cohomological dimensions. method Proves that strongly locally homogeneous generalized continua with cohomological dimension n are generalized Vn-spaces. result Every strongly locally homogeneous continuum of covering dimension n is a Vn-continuum in the sense of Alexandroff. Proves continuum limits of Lipschitz learning using Γ-convergence.
problem Semi-supervised learning with graph-based methods and continuum limits of p-Laplacian learning. method Proves continuum limits of Lipschitz learning using Γ-convergence.
result Proves Γ-convergence in the L∞-topology to the supremum norm of the gradient. New analysis explains pathology of deep Gaussian processes.
problem Pathology of deep Gaussian processes reduces learning capacities with increased layers.
method Study nonlinear dynamic systems corresponding to DGPs, derive recurrence relations.
result Provide tighter bounds and rate of convergence for dynamic systems.
Machine learning improves EEG pathology classification.
problem Automating clinical EEG analysis using machine learning.
method Developed a comprehensive feature-based framework and compared it to deep neural networks.
result Feature-based framework achieves accuracies similar to deep neural networks.
This paper studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
problem Optimizing an unknown function with limited evaluations.
method Studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
result Minimax rates over Besov spaces are identical to those over the smallest Hölder space into which Besov spaces embed.
A mesh-free method solves continuum-marginal optimal transport problems.
problem Recovering minimum-energy velocity fields from time-continuous probability marginals.
method Embeds weak continuity equation in a reproducing kernel Hilbert space, optimizing with mini-batch stochastic methods.
result Accurately recovers drift and maintains marginal consistency in synthetic experiments.
In this paper, we propose a classification based glottal closure instants (GCI) detection from pathological acoustic speech signal, which finds many applications in vocal disorder analysis. Till date, GCI for pathological disorder is extracted from laryngeal (glottal source) signal recorded from Electroglottograph, a d…
Causal methods for GRN inference from single-cell data often fail in real-world benchmarks.
problem Understanding when and why causal methods for GRN inference from single-cell data fail in real-world benchmarks.
method Introduced a controlled diagnostic framework to isolate and measure seven pathologies.
result Causal methods dominate in clean and structurally favorable regimes but fail in specific pathologies.
Optimal reinsurance contracts designed for a continuum of risk types.
problem Designing optimal reinsurance contracts with a continuum of risk types.
method Principal-agent model, VaR at risk tolerance level, change of variables, univariate approach.
result Optimal reinsurance contracts are in stop-loss form, classifying agents into high and low risk groups.
We characterize those planar Peano continua that are homotopy equivalent to 1-dimensional sets. While many planar Peano continua are not homotopically 1-dimensional, we prove that each has fundamental group that embeds in the fundamental group of a 1-dimensional planar Peano continuum. We leave open the following quest…
This work proves the continuum limit of t-SNE for data visualization.
problem Understanding the theoretical basis of t-SNE from a continuum limit perspective.
method Proving the Kullback-Leibler divergence consistency as no∞ for t-SNE. result The continuum variational problem involving non-convex gradient regularization and penalty on probability density function magnitude.
Regularized Stein thinning improves MCMC output approximations.
problem Pathologies in Stein thinning leading to poor approximations.
method Theoretical analysis and regularization to improve KSD.
result Regularized Stein thinning alleviates pathologies and improves efficiency.
Gradient flows on graphons converge to curves on graphon space.
problem Optimizing functions on large, exchangeable graphs.
method Euclidean gradient flow on edge weights converges to a curve on graphon space.
result Gradient flows on graphons can be described as curves of maximal slope on graphon space.
Many statistical learning problems can be posed as minimization of a sum of two convex functions, one typically a composition of non-smooth and linear functions. Examples include regression under structured sparsity assumptions. Popular algorithms for solving such problems, e.g., ADMM, often involve non-trivial optimiz…
Continuum transformers learn operators in context via gradient descent.
problem Generalizing transformers to handle infinite-dimensional inputs for in-context learning.
method Gradient descent in an operator RKHS, leveraging generalized representer theorems and gradient flows.
result Operator learned in context is Bayes Optimal Predictor in infinite depth limit.
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we introduce a subdivision method by applying the Goldberg-Coxeter subdivision and…
We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X.
Continuum-wise hyperbolicity is exactly the pseudo-Anosov dynamics with spine singularities.
problem Classification of continuum-wise hyperbolic surface homeomorphisms
method Proving a complete structural classification
result Every cwF-hyperbolic homeomorphism is pseudo-Anosov with spine singularities We propose a method to classify cardiac pathology based on a novel approach to extract image derived features to characterize the shape and motion of the heart. An original semi-supervised learning procedure, which makes efficient use of a large amount of non-segmented images and a small amount of images segmented manu…
This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the…
For test configurations, the Donaldson-Futaki invariant F_1 is well-known. In this note, its refinement will be discussed. Then we see that Li-Xu's pathology doesn't occur, since their example of a non-normal test configuration, with trivial normalization, actually has non-vanishing F_1 in this refined sense.
New test identifies specific biological parameters for personalized CVD detection.
problem Ineffectual pathology tests fail to consider platelet activation and inter-individual variability.
method Stochastic platelet deposition model and approximate Bayesian computation with discriminative summary statistics.
result Inferred parameters help identify specific biological parameters for personalized CVD detection.
It has been known for a long time that the fundamental group of the quotient of $\RR ^3$ by the Case-Chamberlin continuum is nontrivial. In the present paper we prove that this group is in fact, uncountable.
Using the topologist sine curve we present a new functorial construction of cone-like spaces, starting in the category of all path-connected topological spaces with a base point and continuous maps, and ending in the subcategory of all simply connected spaces. If one starts by a noncontractible n-dimensional Peano cont…
Method treats pseudo healthy synthesis as a factor decomposition problem.
problem Creating a healthy-looking image from a pathological one.
method Adversarial training with paired or unpaired settings, combining two factors (healthy and disease) to reconstruct the input.
result Method outperforms conditional GAN and CycleGAN in generating pseudo healthy images.
We analyze convergence of Fermat distances and their application in clustering.
problem Understanding convergence properties of Fermat distances on Riemannian manifolds.
method Geometric and statistical arguments in percolation theory, leveraging novel arguments for non-uniform densities and curved domains.
result Discrete, sample-based Fermat distances converge to their continuum analogues with a precise rate dependent on intrinsic dimensionality.