Method screens weakly associated predictors in high-dimensional data.
problem Identifying weakly associated predictors in ultrahigh-dimensional data.
method Covariance-insured screening methodology.
result Validates the method through simulations and real data studies.
Deep neural nets learn from weakly dependent processes.
problem Learning from ψ-weakly dependent processes. method Deep neural networks for ψ-weakly dependent processes. result Established consistency of empirical risk minimization algorithm and generalization bound.
The paper develops a deep neural network estimator for weakly dependent processes with various loss functions.
problem Learning weakly dependent processes with a broad class of loss functions.
method Sparse-penalized deep neural networks with ψ-weak dependence structure and θ∞-coefficients. result Oracle inequalities for the excess risk of the sparse-penalized deep neural networks estimators.
We prove that M. Kramer's classification of list of spherical pairs coincides with that for weakly symmetric spaces by examining the linear isotropy representation of the corresponding homogeneous space associated to each pair.
This paper presents Sparse Partitioning, a Bayesian method for identifying predictors that either individually or in combination with others affect a response variable. The method is designed for regression problems involving binary or tertiary predictors and allows the number of predictors to exceed the size of the sa…
Study assesses weakly-supervised methods for rare outcomes in medical records.
problem Identifying patients with specific medical conditions using electronic health records.
method Compared three methods (PheNorm, MAP, and sureLDA) in simulations with varying outcomes and silver labels.
result No single method consistently outperformed others, but sureLDA often did well.
Paper tackles robust deep learning from weakly dependent data with unbounded loss and input.
problem Tackles robust deep learning from weakly dependent data with unbounded loss and input.
method Establishes non-asymptotic bounds for expected excess risk under strong mixing and ψ-weak dependence assumptions. result Derives a relationship between bounds and r, and shows convergence rate close to i.i.d. results for r=∞. In this paper we study weakly irreducible holonomy representations of the normal connection of a spacelike submanifold in a pseudo-Riemannian space from. We associate screen representations to weakly irreducible normal holonomy groups and classify the screen representations having the Borel-Lichnérowicz property. In pa…
We give a simple sufficient condition for Quinn's "bordism-type spectra" to be weakly equivalent to strictly associative ring spectra. We also show that Poincare bordism and symmetric L-theory are naturally weakly equivalent to monoidal functors. Part of the proof of these statements involves showing that Quinn's funct…
Paper introduces MSA for weakly supervised covariance alignment in MEG signals.
problem Limited labeled signals in target datasets for MEG applications.
method Mixing model Stiefel Adaptation (MSA) leveraging unlabeled data.
result MSA outperforms recent methods in brain-age regression with MEG signals.
We introduce a new kind of Riemannian manifold that includes weakly-, pseudo- and pseudo projective- Ricci symmetric manifolds. The manifold is defined through a generalization of the so called Z tensor; it is named "weakly Z symmetric" and denoted by (WZS)_n. If the Z tensor is singular we give conditions for the exis…
Solves weakly supervised regression using low-rank approximations and manifold regularization.
problem Weakly supervised regression with known, unknown, and uncertain labels.
method Combines manifold regularization and low-rank matrix decomposition for optimization.
result Improves solution quality and stability for large datasets.
Study on weakly G-slim complexes and non-positive immersions for group presentations.
problem Conditions for non-positive immersions in group presentations.
method Investigation of weakly G-slim complexes and their relationship to left-orderable groups.
result Conditions on generalized Wirtinger presentations guaranteeing non-positive immersions for their associated 2-complexes.
This paper improves inverse problem solving with weakly convex regularisers and proves convergence.
problem Improving solution methods for inverse problems.
method Generalised formulation of convergent regularisation using weakly convex regularisers, and proof of convergence for primal-dual hybrid gradient method.
result Proves convergence of primal-dual hybrid gradient method for variational problems and shows improved performance with IWCNNs.
Consistent selection of predictors in high-dimensional binary models with misspecified parameters.
problem Selection of predictors in high-dimensional binary models with misspecified parameters.
method Two-step selection procedure: screening and ordering predictors by Lasso, followed by model selection.
result Consistent selection of the support of the minimizer of the associated risk.
Using non-linear machine learning methods and a proper backtest procedure, we critically examine the claim that Google Trends can predict future price returns. We first review the many potential biases that may influence backtests with this kind of data positively, the choice of keywords being by far the greatest culpr…
Efficiency criteria improve conformal predictors' performance.
problem Improving the performance of conformal predictors.
method Learning classifiers by minimizing observed fuzziness as a training objective function.
result Conformal predictors trained by minimizing observed fuzziness perform better than traditional ones.
New method learns optimal prediction strategies in adversarial games.
problem Learning optimal prediction procedures in uncertain data environments.
method Adversarial Monte Carlo approach with neural network architecture.
result Optimal strategy is equivariant and invariant to various transformations.
New unitary representations constructed for complex nilmanifolds.
problem Constructing unitary representations on specific geometric spaces.
method Combining geometric methods with recent developments on pseudo-Riemannian nilmanifolds.
result Developed theory for square integrable representations on complex nilmanifolds.
New method detects essential tori in mixed singularity links.
problem Detecting essential tori in mixed singularity link complements.
method Analyzing properties of defining mixed polynomials.
result Explicit criteria for essential tori existence.
This work is motivated by numerical solutions to Hamilton-Jacobi-Bellman quasi-variational inequalities (HJBQVIs) associated with combined stochastic and impulse control problems. In particular, we consider (i) direct control, (ii) penalized, and (iii) semi-Lagrangian discretization schemes applied to the HJBQVI proble…
In the literature, there are two different notions of pseudosymmetric manifolds, one by Chaki [7] and other by Deszcz [16], and there are many papers related to these notions. The object of the present paper is to deduce necessary and sufficient conditions for a Chaki pseudosymmetric [7] (resp. pseudo Ricci symmetric […
The paper bounds the excess risk of deep neural networks for weakly dependent processes.
problem Learning with weakly dependent data using deep neural networks.
method Approximation of smooth functions by deep neural networks and a bound on excess risk.
result The excess risk bound for deep learning under weak dependence is close to O(n−1/2) for sufficiently smooth functions. Model learns image-word associations from captions using contrastive learning.
problem Phrase grounding, associating image regions to caption words.
method Optimizing word-region attention to maximize mutual information, using language model guided word substitutions for negatives.
result Model achieves 76.7% accuracy on Flickr30K Entities benchmark, a 5.7% gain from weak supervision.
Many modern big data applications feature large scale in both numbers of responses and predictors. Better statistical efficiency and scientific insights can be enabled by understanding the large-scale response-predictor association network structures via layers of sparse latent factors ranked by importance. Yet sparsit…
Sparse-penalized deep neural networks improve performance in weakly dependent processes.
problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.
The study examines how class imbalance impacts logistic regression models in low-default credit portfolios.
problem The impact of class imbalance on logistic regression models in low-default credit portfolios.
method Simulation study with controlled data-generating mechanisms to vary class imbalance and predictor-response association strength.
result Classification accuracy decreases significantly as event rate decreases, and optimal cut-off shifts with imbalance.
The study connects lattices, Garside structures, and weakly modular graphs.
problem Exploring combinatorial non-positive curvature in various simplicial complexes.
method Analyzing lattices with Z-actions and their quotients. result Lattices and their quotients give rise to weakly modular graphs.
The paper studies associative Smith maps and proves their properties, including regularity and energy gap.
problem Analyzing properties of associative Smith maps from 3-manifolds into 7-manifolds.
method Informed by holomorphic curves, the paper proves an ε-regularity theorem and uses the Smith equation's compensation phenomenon.
result Sequences of associative Smith maps with bounded 3-energy can be conformally rescaled to yield bubble trees of such maps.
Researchers predict butt rot volume using harvester data and remote sensing.
problem Predicting butt rot volume in Norway spruce stands for optimal forest management.
method Used random forest models with harvester information, remote sensing, and environmental data.
result Remotely sensed predictor variables were more important than environmental variables.
GIDS reduces high-dimensional response and predictor spaces, improving interpretability and computational efficiency.
problem Challenges in modeling interactions among high-dimensional multimodal data.
method Graph Independence Dual Screening (GIDS) framework that reduces both response and predictor dimensions.
result GIDS reduces feature space to 9,000 CpGs and 2,000 transcripts, revealing coordinated regulatory mechanisms.
A new method for sparse regression models using graph structure.
problem Sparse regression models for high-dimensional data.
method Decomposes coefficient vector into latent variables, performs regularization on latent variables, uses proximal projection.
result Stable performance compared to other models, especially for high-dimensional data.
Proposes a new method to unlearn from specific data points in conformal predictors.
problem Challenges of existing unlearning methods in conformal predictors.
method Formalizes conformal unlearning, introduces practical metrics, and presents an optimization algorithm.
result Demonstrates effective removal of targeted information while preserving utility.
Proposes a new method for multivariate functional regression.
problem Multivariate functional regression with complex relationships.
method Nested reduced-rank regularization (NRRR) approach.
result Consistent and effective in fitting multivariate functional regression models.
Weakly Einstein Kähler surfaces are characterized and classified.
problem Characterizing and classifying weakly Einstein Kähler surfaces.
method Several conditions and constructions to characterize and classify weakly Einstein Kähler surfaces.
result Classification of weakly Einstein Kähler surfaces with specific properties and construction of new examples.
The study examines weakly Einstein Lie groups and proves non-existence for certain types.
problem Characterizing and proving the non-existence of weakly Einstein Lie groups.
method Analyzing left-invariant metrics on Lie groups and using algebraic properties.
result No weakly Einstein non-abelian 2-step nilpotent Lie groups exist.
Hamiltonian Monte Carlo converges to target distributions under mild conditions.
problem Establishing convergence of Hamiltonian Monte Carlo algorithms.
method Analyzing Lq convergence for Hamiltonian Monte Carlo under mild conditions. result Outputs converge to target distributions under specified conditions.
A deep learning framework learns meaningful representations for weakly supervised multiple instance learning.
problem Weakly supervised multiple instance learning with uncertainty in positive instance labels.
method Discriminative model regularized by variational autoencoders to learn latent representations.
result Improved performance on standard benchmark datasets compared to state-of-the-art approaches.
Classifies weakly Einstein submanifolds in space forms satisfying specific equalities.
problem Characterizing submanifolds in space forms with certain geometric properties.
method Classification based on Chen's equality and semisymmetric conditions.
result Classification of weakly Einstein submanifolds in space forms.
E2Tree explains random forest models in regression tasks.
problem Lack of transparency in random forest models.
method E2Tree extends random forest to regression by explaining model predictions through graphical representation and dissimilarity measures.
result E2Tree provides a transparent explanation of random forest models in regression tasks.
The study explores weakly p-Kähler hyperbolic manifolds.
problem Generalization and application of weakly p-Kähler hyperbolic manifolds. method Investigation of generalizations and applications.
result Exploration of weakly p-Kähler hyperbolic manifolds. The paper improves generalization bounds for classifier chains with interdependent labels.
problem Improving generalization for classifier chains with multiple interdependent labels.
method Using large deviation inequalities for weakly dependent sequences, the paper derives a new generalization error bound.
result The derived bound explicitly shows dependencies between class labels and provides insights into the chain's order.
Unified approach for learning with weak labels across various tasks.
problem Learning with noisy or incomplete labels in diverse machine learning settings.
method Implicit posterior models for joint label inference.
result Unified training objective for various machine learning tasks.
Study weakly weighted Einstein-Finsler metrics, showing specific curvature properties and characterizing them.
problem Characterizing weakly weighted Einstein-Finsler metrics.
method Showed isotropic S-curvature under certain conditions. Characterized via navigation expressions and α and β. result Weakly weighted Einstein-Kropina metrics have isotropic S-curvature and can be completely characterized.
The present paper is intended to provide the basis for the study of weakly differentiable functions on rectifiable varifolds with locally bounded first variation. The concept proposed here is defined by means of integration by parts identities for certain compositions with smooth functions. In this class the idea of ze…
The paper provides examples of keen weakly reducible bridge spheres for links in b-bridge position.
problem Characterizing and finding examples of keen weakly reducible bridge spheres.
method Analyzing bridge spheres and their properties in terms of compressing disks and width complex.
result Infinitely many examples of keen weakly reducible bridge spheres for links in b-bridge position.
Proposes a new hyperprior and predictive criterion for weakly informative hyperprior in relevance vector machine.
problem Capturing non-homogeneous data structure with limited kernel functions.
method Uses inverse gamma hyperprior with a shape parameter close to zero and a scale parameter not close to zero. Applies multiple kernel method with different widths. Proposes extended predictive information criterion for scale parameter selection.
result Obtains a multiple kernel relevance vector regression model with good predictive accuracy.
This paper introduces first order Sobolev spaces on certain rectifiable varifolds. These complete locally convex spaces are contained in the generally nonlinear class of generalised weakly differentiable functions and share key functional analytic properties with their Euclidean counterparts. Assuming the varifold to s…