Combines active learning and imbalance-aware classification for protein function prediction.
problem Scarce positive labels and lack of explicit negative labels in supervised learning.
method Active learning for selecting negative examples and imbalance-aware classification for mitigating label imbalance.
result The combined techniques outperform state-of-the-art methods on protein function prediction benchmarks.
Efficient Bayesian variable selection for binomial and negative binomial data.
problem Computational challenges in Bayesian variable selection for complex models.
method Tempered Gibbs Sampling and MCMC scheme.
result Demonstrated effectiveness on cancer data with thousands of covariates.
New unsupervised method selects hard negative samples for contrastive learning.
problem How to select good negative examples for contrastive learning without using true similarity information.
method Developed a new family of unsupervised sampling methods for hard negative selection.
result Improves downstream performance across multiple modalities.
We consider a problem of grouping multiple graphs into several clusters using singular value thesholding and non-negative factorization. We derive a model selection information criterion to estimate the number of clusters. We demonstrate our approach using "Swimmer data set" as well as simulated data set, and compare i…
Proposes cost-sensitive feature selection for SVMs.
problem Asymmetric misclassification costs in feature selection.
method Mathematical optimization-based approach for SVMs.
result Substantial reduction in feature count with desired error rates.
Bayesian method tackles variable selection in high-dimensional data.
problem Challenges in Bayesian variable selection with large P.
method Efficient MCMC scheme with sublinear cost per iteration, extended to generalized linear models.
result Demonstrated effectiveness on cancer and maize genomic data.
This paper shows how optimizing with hard negative examples improves image retrieval.
problem Training with hard negative examples leads to poor training behavior.
method Characterize the space of triplets, derive why hard negatives fail, and offer a fix to the loss function.
result Optimizing with hard negative examples leads to more generalizable features and better image retrieval.
This paper proposes a new method to use unlabeled data as positive data, improving PU learning.
problem Improving positive-unlabeled learning methods in deep learning.
method Labeling large-loss unlabeled data as positive data and developing a new learning objective.
result The proposed method outperforms the latest importance reweighting method in experiments.
Novel unsupervised feature selection method using multi-step Markov transition probability.
problem Neglected relationships between non-adjacent data points in feature selection.
method MMFS (Multi-step Markov transition probability for Feature Selection) approach, employing positive and negative viewpoints.
result MMFS effectively maintains data structure in unsupervised feature selection.
ATPboost uses ATP feedback for binary premise selection in large-theory problem solving.
problem Learning relevant premises for ATP-based theorem proving in binary classification.
method Binary classification using XGBoost, with negative examples generated from alternative proofs.
result ATPboost outperforms k-nearest neighbors in binary premise selection.
We consider a problem of clustering a sequence of multinomial observations by way of a model selection criterion. We propose a form of a penalty term for the model selection procedure. Our approach subsumes both the conventional AIC and BIC criteria but also extends the conventional criteria in a way that it can be app…
Adaptive data collection leads to biased estimates, which this paper corrects.
problem Adaptive data collection introduces systematic negative bias in sample means.
method Proved negative bias, proposed debiasing algorithm based on selective inference.
result Debiasing algorithm effectively reduces bias and estimation error.
New method for inference on covariates in NMF with random effects.
problem Formal inference for covariate effects in NMF with non-negativity constraints.
method NMF-RE model with random effects, ridge updates, df-based cap, asymptotic linearization, wild bootstrap.
result Valid inference on covariates with non-negativity constraint, avoiding degeneracy.
In this paper, we consider voxel selection for functional Magnetic Resonance Imaging (fMRI) brain data with the aim of finding a more complete set of probably correlated discriminative voxels, thus improving interpretation of the discovered potential biomarkers. The main difficulty in doing this is an extremely high di…
A robust framework maximizes AUC with outlier detection and feature selection for PU classification.
problem Challenges in PU classification, especially with complex data and mislabeled/unlabeled samples.
method Unified AUC maximization, outlier detection, and feature selection.
result Generalization error bounds and practical guidance for model training.
SANS uses graph structure to find meaningful negatives for entity and relation embeddings.
problem Finding hard negatives for entity and relation embeddings in knowledge graphs.
method Structure Aware Negative Sampling (SANS) that selects negatives from a node's k-hop neighborhood.
result SANS finds semantically meaningful negatives and is competitive with state-of-the-art approaches.
New regularization method corrects over-shrinkage in small data regression.
problem Over-shrinkage in small data regression leading to underfitting.
method Negative-capable ridge family that permits negative regularization.
result Negative regularization acts as controlled anti-shrinkage, increasing effective complexity.
Paper proposes a method to identify negative transfers in multitask learning using surrogate models.
problem Identifying subsets of source tasks that improve target task performance in multitask learning.
method Surrogate modeling to precompute multitask learning performances and approximate them with a linear regression model.
result The approach predicts negative transfers from multiple source tasks to target tasks more accurately than existing methods.
A new objective function for NMF reduces model complexity and improves accuracy.
problem NMF's error-based objective function can lead to overly complex models.
method MDL-NMF uses minimum description length to balance model complexity and accuracy.
result MDL-NMF outperforms traditional NMF on various datasets.
This work improves classification performance by selecting critical samples for Nyström methods.
problem Lack of supervision in Nyström methods leads to poor classification performance.
method Selects Nyström support vectors via negative margin criterion to create better feature maps.
result Significantly improves classification performance compared to unsupervised methods.
New theory shows how learning algorithms can create a bias towards negative outcomes.
problem Negativity bias in adaptive learning algorithms.
method Generalization of the Hot Stove Effect to settings with negative estimates leading to smaller sample sizes.
result Negativity bias persists even when negative estimates do not lead to avoidance.
One of the longstanding open problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. We propose automated mode…
Develops a model for RNA-seq data clustering.
problem Challenges in clustering RNA-seq count data with variable selection.
method Sparse negative binomial mixture model with lasso or fused lasso regularization.
result Superior performance in clustering accuracy, feature selection, and biological interpretation.
The study addresses negative transfer in multi-output Gaussian processes by proposing latent structures.
problem Negative transfer in multi-output Gaussian processes leading to decreased performance.
method Defining negative transfer, deriving conditions for avoiding it, proposing latent structures.
result Latent structures can avoid negative transfer and scale to large datasets.
This paper improves neural machine translation training by selecting and denoising data.
problem Reduces negative impact of noisy data on neural machine translation training.
method Measures and selects domain data, applies denoising curriculum using online data selection.
result Significant effectiveness for training on noisy data.
Autoencoder selects relevant source samples for self-taught learning.
problem Negative transfer from irrelevant source samples.
method Autoencoder with ℓ2,1-norm sparsity constraint for relevance metric. result Promising results in expanded training set for classifier training.
Count data, for example the number of observed cases of a disease in a city, often arise in the fields of healthcare analytics and epidemiology. In this paper, we consider performing regression on multivariate data in which our outcome is a count. Specifically, we derive log-likelihood functions for finite mixtures of …
A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretization (vertex contraction). Such discretization together with non-negative factorization techniques c…
Study on MMV in jump-diffusion models resolves MV's non-monotonicity issues.
problem Non-monotonicity and free cash flow stream problems in MV preferences.
method Explicit solution for MMV preferences in jump-diffusion models, proving non-negative potential measures.
result MMV resolves MV's non-monotonicity and free cash flow stream issues.
Signed network models reduce portfolio risk by considering negative edges in financial markets.
problem Tackles portfolio optimization in financial markets by exploiting negative edges in network representations.
method Proposes a discrete optimization scheme to reduce asset selection, building time series of signed networks from asset returns.
result Empirical results show that signed network portfolios perform similarly to classical mean-variance optimization and equally weighted benchmarks.
NCL improves interpretability of deep features by enforcing non-negativity.
problem Lack of interpretability in deep representations.
method Non-negative Contrastive Learning (NCL) using non-negativity constraints.
result NCL outperforms standard contrastive learning in feature disentanglement and selection.
A new sampling method improves word representation by considering multi-dimensional features.
problem Improving word representation in skip-gram models with negative sampling.
method Proposes a new sampling algorithm that dynamically selects informative negative samples based on inner product scores and multi-dimensional self-embedded features.
result The new sampling method outperforms existing ones without increasing computational complexity.
Study selective classification with halfspaces, achieving error bounds under Gaussian distributions.
problem Modeling relationships in subsets of data defined by selection rules.
method Sparse linear classifiers for subsets defined by halfspaces, focusing on Gaussian feature distributions.
result First PAC-learning algorithm for homogeneous halfspace selectors with error guarantee $\bigO*{\sqrt{\mathrm{opt}}}$.
A new method for decomposing non-negative tensors using energy-based modeling.
problem Challenges in traditional tensor decomposition methods, especially global optimization and rank selection.
method Energy-based modeling of tensors, considering interactions between modes for global optimization.
result Demonstrates effectiveness in tensor completion and approximation, revealing a relationship between many-body and low-rank approximations.
Study shows mimicry attacks fail even with ASV-assisted target selection.
problem Can mimicry attacks be successful with ASV-assisted target selection?
method Used ASV to select target speakers for mimicry attacks and tested with x-vector system.
result Mimics did not succeed in spoofing the x-vector system, but relative ordering of targets was consistent.
Instance selection improves geometric mean accuracy in imbalanced data classification.
problem Improving classification success on imbalanced data using geometric mean.
method Instance selection to maximize geometric mean.
result GM is non-monotonic with instance selection, and balancing frequencies is inferior.
Proposes a method for selecting variables in nonparametric learning using power series kernels.
problem Variable selection in nonparametric learning with power series kernels.
method Two-stage estimation: consistent function approximation followed by l1-type penalized variable selection.
result The method achieves variable selection consistency for power series kernels.
Feature selection methods are usually evaluated by wrapping specific classifiers and datasets in the evaluation process, resulting very often in unfair comparisons between methods. In this work, we develop a theoretical framework that allows obtaining the true feature ordering of two-dimensional sequential forward feat…
Streaming method improves weakly submodular function approximation.
problem Optimizing weakly submodular functions with streaming algorithms.
method Streaming algorithm for RSC and RSM functions.
result Constant factor approximation for weakly submodular functions.
We develop a framework for post model selection inference, via marginal screening, in linear regression. At the core of this framework is a result that characterizes the exact distribution of linear functions of the response y, conditional on the model being selected (``condition on selection" framework). This allows…
Bayesian Quadrature speeds up integration by selecting batches of points instead of single points.
problem Efficiently parallelizing Bayesian Quadrature for integration over non-negative integrands.
method Developed methods to select batches of points at each step, based on recent batch Bayesian Optimization.
result Significantly reduces computation time, especially for expensive integrands.
Bayesian approach selects features for a specific target with high confidence.
problem Feature acquisition costs and target-specific uncertainty.
method Bayesian feature selection targeting specific outcomes.
result Feature selection for a specific target is superior to common methods.
A new method accelerates deep neural network training using minimal margin score.
problem Training deep neural networks is computationally expensive.
method Introduces minimal margin score (MMS) for selecting samples.
result Significant acceleration in training deep neural networks.
A new method using negative-shifted gradient descent improves overparameterized linear regression by avoiding structural limitations of negative ridge endpoints.
problem Structural limitations of negative ridge endpoints in overparameterized linear regression.
method Negative-shifted gradient descent, which avoids the pole constraint of negative ridge endpoints.
result The method improves over all admissible endpoints by a polynomial factor in risk under explicit conditions.
Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…
This paper calculates worst-case target semi-variances for uncertain losses.
problem Managing risk when loss distribution is uncertain and only partial information is known.
method Derives worst-case target semi-variances for symmetric or non-negative losses under uncertainty sets representing investor's undesirable scenarios.
result Closed-form expressions for worst-case target semi-variances are derived.
The discrete-time mean-variance portfolio selection formulation, a representative of general dynamic mean-risk portfolio selection problems, does not satisfy time consistency in efficiency (TCIE) in general, i.e., a truncated pre-committed efficient policy may become inefficient when considering the corresponding trunc…
WIPS optimizes inner product weights to approximate various similarities.
problem Learning high-quality node representations and accurate similarities.
method Weighted inner product similarity (WIPS) with adjustable weights.
result WIPS can approximate arbitrary general similarities including positive definite and indefinite kernels.