arXiv research

Combines Xgboost and transductive SVM for semi-supervised learning.

Use of computational methods to predict gene regulatory networks (GRNs) from gene expression data is a challenging task. Many studies have been conducted using unsupervised methods to fulfill the task; however, such methods usually yield low prediction accuracies due to the lack of training data. In this article, we pr…

We consider the problem of learning a binary classifier from a training set of positive and unlabeled examples, both in the inductive and in the transductive setting. This problem, often referred to as \emph{PU learning}, differs from the standard supervised classification problem by the lack of negative examples in th…

The support vector machine (SVM) is an important class of learning machines for function approach, pattern recognition, and time-serious prediction, etc. It maps samples into the feature space by so-called support vectors of selected samples, and then feature vectors are separated by maximum margin hyperplane. The pres…

We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductive Rademacher complexity. Our technique is based on a novel general error bound for transduction in terms of transductive Rademacher complexity, together with a novel bounding technique for Rademacher…

The paper establishes bounds for transductive learning using information theory.

Local regularization fails in transductive learning for some multiclass problems.

Kernel-based learning algorithms are widely used in machine learning for problems that make use of the similarity between object pairs. Such algorithms first embed all data points into an alternative space, where the inner product between object pairs specifies their distance in the embedding space. Applying kernel met…

Improved mistake bounds for transductive online learning.

New method TLC improves transductive learning bounds.

Transductive learning considers situations when a learner observes $m$ labelled training points and $u$ unlabelled test points with the final goal of giving correct answers for the test points. This paper introduces a new complexity measure for transductive learning called Permutational Rademacher Complexity (PRC) and …

The paper finds a fundamental trade-off between confidence and efficiency in transductive conformal prediction.

Transductive learning considers a training set of $m$ labeled samples and a test set of $u$ unlabeled samples, with the goal of best labeling that particular test set. Conversely, inductive learning considers a training set of $m$ labeled samples drawn iid from $P(X,Y)$, with the goal of best labeling any future sample…

Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by this, we introduce a deep neural model for learning structure-to-substructure tree …

Adversarial robust learning improved for transductive setting.

Proposes a framework for compositional generalization in language models.

Many machine learning tasks can be expressed as the transformation---or \emph{transduction}---of input sequences into output sequences: speech recognition, machine translation, protein secondary structure prediction and text-to-speech to name but a few. One of the key challenges in sequence transduction is learning to …

Multi-group learners suffer a penalty in transductive learning.

Study shows transductive learning is equivalent to PAC learning for most natural loss functions.

The paper surveys recent extensions of the Long-Short Term Memory networks to handle tree structures from the perspective of learning non-trivial forms of isomorph structured transductions. It provides a discussion of modern TreeLSTM models, showing the effect of the bias induced by the direction of tree processing. An…

Proposes a transductive matrix completion method with calibration for multi-task learning.

New bounds improve graph node classification using optimal transport.

Most traditional online learning algorithms are based on variants of mirror descent or follow-the-leader. In this paper, we present an online algorithm based on a completely different approach, tailored for transductive settings, which combines "random playout" and randomized rounding of loss subgradients. As an applic…

Standard methods in supervised learning separate training and prediction: the model is fit independently of any test points it may encounter. However, can knowledge of the next test point $\mathbf{x}_{\star}$ be exploited to improve prediction accuracy? We address this question in the context of linear prediction, show…

PAC learning simplified as bipartite matching.

We present transductive Boltzmann machines (TBMs), which firstly achieve transductive learning of the Gibbs distribution. While exact learning of the Gibbs distribution is impossible by the family of existing Boltzmann machines due to combinatorial explosion of the sample space, TBMs overcome the problem by adaptively …

We show two novel concentration inequalities for suprema of empirical processes when sampling without replacement, which both take the variance of the functions into account. While these inequalities may potentially have broad applications in learning theory in general, we exemplify their significance by studying the t…

TIM maximizes mutual information for few-shot learning, outperforming state-of-the-art methods.

Supervised learning with large scale labeled datasets and deep layered models has made a paradigm shift in diverse areas in learning and recognition. However, this approach still suffers generalization issues under the presence of a domain shift between the training and the test data distribution. In this regard, unsup…

PARMESAN learns from memory without parameters for fast, efficient continual learning.

Improved few-shot learning with LSSVM and transductive modules.

New method uses graph-based interpolation for few-shot classification.

The study finds conditions for compressing the hidden dimension of Graph Transformers for transductive learning.

Improved bounds for unbounded losses using transductive priors.

New methods learn from single graphs, improving transductive node classification.

Graph neural networks generalize well under certain conditions, explained by learning theory.

GEN tackles few-shot out-of-graph link prediction in evolving multi-relational graphs.

Study on tradeoffs between mistakes and ERM oracle calls in online and transductive learning.

Compact learning results across various loss functions.

New method improves transductive learning predictions with multiplicative oracle inequalities.

We consider using an ensemble of binary classifiers for transductive prediction, when unlabeled test data are known in advance. We derive minimax optimal rules for confidence-rated prediction in this setting. By using PAC-Bayes analysis on these rules, we obtain data-dependent performance guarantees without distributio…

Proposes a neural framework to select subsets efficiently across different models.

A new method for few-shot learning using Laplacian regularization.

Enhances few-shot image classification using unlabelled examples.

Proposed SMO algorithm for OC-SVM+ significantly outperforms non-sequential algorithms.

Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor algorithm, LMNN, are two very popular learning algorithms with quite different learning biases. In this paper we bring them into a unified view and show that they have a much stronger relation than what is commonly thought. We analyze SVMs from a metr…

Unified Pin-SVM improves accuracy over existing Pin-SVM model.

DEAL model predicts links for new nodes with only attribute info.