This paper presents an unsupervised algorithm for nonlinear unmixing of hyperspectral images. The proposed model assumes that the pixel reflectances result from a nonlinear function of the abundance vectors associated with the pure spectral components. We assume that the spectral signatures of the pure components and t…
META2 improves taxonomic classification and abundance estimation in metagenomics with deep learning and memory efficiency.
problem Memory constraints and inefficiencies in taxonomic classification and abundance estimation for metagenomics.
method Developed a novel memory-efficient read classification technique combining deep learning and locality-sensitive hashing, and formulated abundance estimation as a Multiple Instance Learning problem.
result Our approach outperforms conventional methods in both single-read taxonomic classification and abundance estimation, especially when memory is limited.
The non-vanishing conjecture implies the abundance conjecture in certain cases.
problem Abundance conjecture in algebraic geometry.
method Proof of the abundance conjecture under specific conditions.
result The abundance conjecture holds in dimensions ≤ 5 when κ ≥ 0 and ν ≤ 1.
Study of superintegrable systems linked to affine hypersurfaces.
problem Understanding superintegrable systems through geometric structures.
method Established a correspondence between superintegrable systems and affine hypersurfaces, defining conformal equivalence.
result Identified conformal classes of abundant manifolds with abundant hypersurface immersions.
The paper proves conditions for the Abundance conjecture in minimal projective klt pairs.
problem Proving the Abundance conjecture for minimal klt pairs with non-zero canonical bundle.
method Analyzing asymptotic behavior of multiplier ideals and properties of supercanonical currents.
result Supercanonical currents are central to proving the Abundance conjecture.
In a plethora of applications dealing with inverse problems, e.g. in image processing, social networks, compressive sensing, biological data processing etc., the signal of interest is known to be structured in several ways at the same time. This premise has recently guided the research to the innovative and meaningful …
Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.
problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.
New method uses neural networks to infer dark matter subhalo abundance from stellar streams.
problem Constrain warm dark matter mass using stellar streams.
method Amortized Approximate Likelihood Ratios (AALR) for likelihood-free Bayesian inference.
result Demonstrates effectiveness of new method for estimating dark matter subhalo abundance.
PRESTO improves rare event prediction by shrinking towards proportional odds model.
problem Difficult to predict rare events due to class imbalance.
method PRESTO relaxes proportional odds model by estimating separate weights for transitions between categories, imposing L1 penalty to shrink towards proportional odds.
result PRESTO consistently estimates decision boundary weights under sparsity assumption, improving rare probability estimation.
We show that a generic real projective n-dimensional hypersurface of degree 2n-1 contains "many" real lines, namely, not less than (2n-1)!!, which is approximately the square root of the number of complex lines. This estimate is based on the interpretation of a suitable signed count of the lines as the Euler number of …
Develops methods for causal inference in compositional data using instrumental variables.
problem Interpreting summary statistics like diversity indices as causal effects in compositional data.
method Statistical data transformations and regression techniques tailored for compositional data.
result Advantages and limitations of the proposed methods demonstrated on synthetic and real microbiome data.
We present a new algorithm for boosting generalized additive models for location, scale and shape (GAMLSS) that allows to incorporate stability selection, an increasingly popular way to obtain stable sets of covariates while controlling the per-family error rate (PFER). The model is fitted repeatedly to subsampled data…
A semi-supervised framework using stochastic interpolation and latent representations.
problem Challenges in conditional generative modeling with scarce labeled data.
method Combines conditional stochastic interpolation with low-dimensional latent representations.
result Significantly improves sample complexity and achieves faster convergence rate.
Study shows torsion grows subexponentially in book of I-bundles but can grow exponentially in non-regular covers.
problem Growth rates of torsion in book of I-bundles.
method Analysis of torsion in homology of book of I-bundles using finite-sheeted covers.
result Torsion growth rates differ between regular and non-regular finite-sheeted covers.
Spectral variability is one of the major issue when conducting hyperspectral unmixing. Within a given image composed of some elementary materials (herein referred to as endmember classes), the spectral signature characterizing these classes may spatially vary due to intrinsic component fluctuations or external factors …
The paper proves conditions for minimal compact Kähler manifolds with vanishing second Chern class.
problem Conditions for minimal compact Kähler manifolds with vanishing second Chern class.
method Study of the abundance conjecture and associated Iitaka fibrations.
result For a minimal compact Kähler manifold, the second Chern class vanishes if and only if the cotangent bundle is nef and the canonical bundle has numerical dimension 0 or 1.
Solving real-world problems, particularly with deep learning, relies on the availability of abundant, quality data. In this paper we develop a novel framework that maximises the utility of time-series datasets that contain only small quantities of expertly-labelled data, larger quantities of weakly (or coarsely) labell…
GPNs use unlabeled data to estimate uncertainty in Bayesian problems.
problem Limited training data in high-dimensional problems.
method Generative Posterior Networks (GPNs) that approximate the posterior distribution using unlabeled data.
result GPNs improve epistemic uncertainty estimation and scalability.
We formulate and prove that there are "abundant" in nilpotent orbits in real semisimple Lie algebras, in the following sense. If S denotes the collection of hyperbolic elements corresponding the weighted Dynkin diagrams coming from nilpotent orbits, then S span the maximally expected space, namely, the (-1)-eigenspace …
Paper analyzes weak-to-strong generalization in CNNs, identifying data-scarce and data-abundant regimes.
problem Weak-to-strong generalization in CNNs trained on weak models.
method Formal analysis of gradient descent dynamics in data-scarce and data-abundant regimes.
result Identifies two regimes and distinct mechanisms of generalization in each.
The abundance of high-dimensional data in the modern sciences has generated tremendous interest in penalized estimators such as the lasso, scaled lasso, square-root lasso, elastic net, and many others. In this paper, we establish a general oracle inequality for prediction in high-dimensional linear regression with such…
Understanding cities is central to addressing major global challenges from climate and health to economic resilience. Although increasingly perceived as fundamental socio-economic units, the detailed fabric of urban economic activities is only now accessible to comprehensive analyses with the availability of large data…
Superintegrable systems on curved manifolds found to have Hessian structures.
problem Characterizing superintegrable systems on curved manifolds.
method Identifying and computing Hessian coordinates for superintegrable systems.
result Examples of superintegrable systems in 2D and 3D have natural Hessian coordinates.
Predictive analytics is increasingly used to guide decision-making in many applications. However, in practice, we often have limited data on the true predictive task of interest, and must instead rely on more abundant data on a closely-related proxy predictive task. For example, e-commerce platforms use abundant custom…
New product structures encode superintegrable Hamiltonian systems in Euclidean spaces.
problem Encoding superintegrable Hamiltonian systems using product structures.
method Introducing commutative and associative product structures on Euclidean spaces of dimension at least three, satisfying specific conditions.
result All abundant superintegrable Hamiltonian systems on Euclidean space of dimension at least three arise from these product structures.
The paper finds many negatively curved Kähler metrics on complex manifolds.
problem Finding Kähler metrics with negative curvature on complex manifolds.
method Analyzes vector bundles and proves dimension estimates and Liouville theorems.
result Proves existence of complete Kähler metrics with negative curvature on certain total spaces.
Deep model tackles zero-inflated multi-species abundance estimation.
problem Predicting species distribution across landscapes with inflated zero counts.
method Proposes a novel deep learning model combining multivariate probit and log-normal distributions.
result Model outperforms existing methods on bird and fish population datasets.
Proposes a method to adapt models in nonstationary environments using ℓ1 regularization.
problem Adapting models to nonstationary environments in machine learning.
method Integrates ℓ1 regularization of differences between source and target parameters.
result Effective balance of stability and plasticity in model adaptation.
Estimating the travel time of a path is of great importance to smart urban mobility. Existing approaches are either based on estimating the time cost of each road segment which are not able to capture many cross-segment complex factors, or designed heuristically in a non-learning-based way which fail to utilize the exi…
Proposes VCNet for estimating ADRFs of continuous treatments.
problem Estimating ADRFs of continuous treatments from observational data.
method VCNet for improved model expressiveness and continuity; targeted regularization for finite sample performance.
result Improves model expressiveness and continuity of ADRFs.
Investigates upsampling vs. upweighting for balanced training on skewed datasets.
problem Balancing training on heavily imbalanced datasets with scarce data.
method Theoretical and empirical analysis of upsampling and upweighting strategies.
result Upsampling and upweighting diverge under stochastic gradient descent, with upsampling leading to faster convergence but higher overfitting risk.
The study finds abundant normal generators for mapping class groups.
problem Understanding normal generation in mapping class groups.
method Analyzing restrictions on invariant subsurfaces and Teichmüller spaces.
result Reducible mapping classes can normally generate mapping class groups based on their asymptotic translation lengths.
Stochastic methods improve data assimilation with high-frequency sensor data.
problem Computational challenges in data assimilation with high-frequency sensor data.
method Adapted stochastic approximation methods to handle high-frequency observations.
result Produces high-quality estimates using all observations without compromising statistical accuracy.
Diffusion-weighted MR imaging (DWI) is the only method we currently have to measure connections between different parts of the human brain in vivo. To elucidate the structure of these connections, algorithms for tracking bundles of axonal fibers through the subcortical white matter rely on local estimates of the fiber …
A new LDA model with covariates for mixed-membership clusters.
problem Modeling mixed-membership clusters in discrete data with covariates.
method Negative binomial regression embedded within LDA, slice sampling within Gibbs sampling.
result Model successfully retrieves true parameter values and predicts cluster abundances using covariates.
A new method speeds up spectral normalization for neural nets.
problem Efficiently controlling the spectral norm of convolutional layers.
method Depthwise separable convolutions with spectral normalization.
result Significant reduction in computational and memory costs.
We construct examples of complete Riemannian manifolds having the property that every geodesic lies in a totally geodesic hyperbolic plane. Despite the abundance of totally geodesic hyperbolic planes, these examples are not locally homogenous.
New method handles missing data using AI for efficient inference.
problem Parameter estimation and inference with blockwise missing data.
method Tractable solution using AI models and semiparametric theory.
result IBM(RAY) and IBM(Adaptive) estimators achieve efficiency gains.
Modern health data science applications leverage abundant molecular and electronic health data, providing opportunities for machine learning to build statistical models to support clinical practice. Time-to-event analysis, also called survival analysis, stands as one of the most representative examples of such statisti…
GLIMPS tackles abundant outlier detection in matched subspace detection.
problem Detecting matched subspaces in high-dimensional data with a high proportion of outliers.
method Two-stage approach combining greedy algorithm and mixed integer programming.
result GLIMPS can tolerate over 80% outliers, significantly outperforming state-of-the-art methods.
Study uses surrogate data to improve treatment effect estimation with scarce outcome data.
problem Limited outcome data hinders estimating treatment effects.
method Uses abundant surrogate data to estimate treatment effects without stringent assumptions.
result Improves precision of treatment effect estimation.
This article introduces a framework to estimate the value of evidence-based decision making.
problem Lack of empirical tools to assess the value of evidence-based decision making and optimize statistical precision.
method Empirical framework using parametric and nonparametric empirical Bayes methods.
result The value of statistical evidence depends on how organizations translate it into policy decisions.
Integrates nearest neighbors with neural networks for more accurate treatment effect estimation.
problem Inaccurate causal effect estimations from observational data.
method NNCI methodology integrating nearest neighbors with neural network models.
result Improves treatment effect estimations on various benchmarks.
Estimation of the number of endmembers existing in a scene constitutes a critical task in the hyperspectral unmixing process. The accuracy of this estimate plays a crucial role in subsequent unsupervised unmixing steps i.e., the derivation of the spectral signatures of the endmembers (endmembers' extraction) and the es…
A new method resolves permutation issues in shuffled linear regression for large-scale applications.
problem Estimating latent features through linear transformation with unknown permutations.
method Spectral matching method to align spectral components of measurement and feature covariances.
result Achieves accurate estimates in shuffled LS and LASSO settings with sufficient samples.
Uniform bounds prove connection between Kähler metrics and RCD spaces.
problem Bounding Nash entropy and Calabi energy for Kähler metrics.
method Proving uniform Sobolev bounds for Kähler manifolds.
result Establishes connection to RCD spaces and provides examples.
This paper addresses the problem of blind and fully constrained unmixing of hyperspectral images. Unmixing is performed without the use of any dictionary, and assumes that the number of constituent materials in the scene and their spectral signatures are unknown. The estimated abundances satisfy the desired sum-to-one …
ECV method optimizes ensemble parameters for randomized ensembles.
problem Efficient tuning of ensemble parameters in randomized ensembles.
method ECV (Extrapolated Cross-Validation) method for tuning ensemble and subsample sizes.
result ECV yields δ-optimal ensembles for squared prediction risk.