Zero loss is achievable in overparametrized DL networks under specific conditions.
problem Achieving zero loss in overparametrized deep learning networks.
method Determine sufficient conditions for zero loss attainability and present an explicit construction of zero loss minimizers.
result Explicit minimizers for zero loss in overparametrized DL networks are constructed without gradient descent.
Paper proposes redundancy-free features for zero-shot object recognition.
problem Redundant visual features degrade zero-shot object recognition.
method Project original features into a new, statistically independent space.
result RFF-GZSL achieves competitive results on benchmark datasets.
Improved Zero learning framework wins games like Hex and Havannah.
problem Improving Zero learning for board games with limited resources.
method Fully convolutional structure, global pooling, and checkpointing.
result Won against strong humans in Hex and Havannah.
ZICO learns DAGs from zero-inflated count data efficiently.
problem Learning network structures from zero-inflated count data.
method ZICO uses node-wise likelihoods with canonical links and a differentiable surrogate constraint for acyclicity.
result ZICO achieves superior performance and faster runtimes on simulated data.
Zero-inflated datasets, which have an excess of zero outputs, are commonly encountered in problems such as climate or rare event modelling. Conventional machine learning approaches tend to overestimate the non-zeros leading to poor performance. We propose a novel model family of zero-inflated Gaussian processes (ZiGP) …
Zero-shot learning transfers knowledge from seen classes to novel unseen classes to reduce human labor of labelling data for building new classifiers. Much effort on zero-shot learning however has focused on the standard multi-class setting, the more challenging multi-label zero-shot problem has received limited attent…
Gradient descent struggles to achieve zero loss in deep learning models due to non-generic data distributions.
problem Achieving zero loss minimizers in deep learning networks.
method Analysis of gradient descent algorithm in deep learning, focusing on underparametrized networks.
result Zero loss minimization cannot be achieved generically in deep learning networks.
Because it is not feasible to collect training data for every language, there is a growing interest in cross-lingual transfer learning. In this paper, we systematically explore zero-shot cross-lingual transfer learning on reading comprehension tasks with a language representation model pre-trained on multi-lingual corp…
We address the problem of learning fine-grained cross-modal representations. We propose an instance-based deep metric learning approach in joint visual and textual space. The key novelty of this paper is that it shows that using per-image semantic supervision leads to substantial improvement in zero-shot performance ov…
This work improves fairness in federated learning by using zero-shot data augmentation.
problem Statistical heterogeneity leads to biased and less uniform accuracy across clients in federated learning.
method Proposes a federated learning system with zero-shot data augmentation to mitigate statistical heterogeneity and improve fairness.
result Empirical results show improved test accuracy and fairness across clients.
CLIP learns joint image-text representations for zero-shot learning.
problem Understanding and improving zero-shot transfer performance in CLIP.
method Formal study of transferrable representation learning and analysis of zero-shot transfer performance.
result Proposes a new CLIP-type approach that outperforms existing methods.
Study shows zero-shot super-resolution in neural operators is impossible in many cases.
problem Understanding the theoretical limits of zero-shot super-resolution in neural operators.
method Systematic theoretical study including information-theoretic and generalization bounds analysis.
result Zero-shot super-resolution is information-theoretically impossible in many settings.
Theory explains how AI models can predict unseen tasks without labeled data.
problem Understanding how AI models can generalize to unseen tasks.
method Developed a theoretical framework to analyze zero-shot prediction.
result Identified key quantities and independence relationships for generalization.
Paper proposes CCVAE for generalized zero-shot domain adaptation.
problem Adapting to unseen classes in target domain with limited labeled data.
method Coupled Conditional Variational Autoencoder (CCVAE).
result CCVAE generates synthetic target domain features for unseen classes.
Faster ZSL with continual learning and self-gating.
problem Generalizing models to unseen categories and handling sequential data.
method Meta-continual zero-shot learning (MCZSL) with self-gating and scaled class normalization.
result Outperforms state-of-the-art results with faster training (>100imes). Paper tackles target shift in zero-shot learning using adversarial learning.
problem Target shift in zero-shot learning leads to performance degradation.
method Estimates target shift using class-attribute mapping and applies grouped adversarial learning.
result Improves zero-shot learning performance on multiple datasets.
A RL approach finds Nash equilibrium for turn-based zero-sum games.
problem Finding Nash equilibrium in two-player turn-based zero-sum games.
method EIS method combining exploration, policy improvement, and supervised learning.
result EIS method finds an ε-approximate value function of Nash equilibrium in O(ε^(-(d+4))) steps.
We propose a comprehensive end-to-end pipeline for Twitter hashtags recommendation system including data collection, supervised training setting and zero shot training setting. In the supervised training setting, we have proposed and compared the performance of various deep learning architectures, namely Convolutional …
ZSL-KG learns class representations from common sense knowledge graphs.
problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.
We present a domain adaptation based generative framework for zero-shot learning. Our framework addresses the problem of domain shift between the seen and unseen class distributions in zero-shot learning and minimizes the shift by developing a generative model trained via adversarial domain adaptation. Our approach is …
A new test detects differences between two distributions without flow.
problem Detecting differences between two distributions without flow.
method Zero-flow discrepancy (ZFD) and zero-flow two-sample test (ZF2ST).
result ZF2ST can detect strong differences in structured distributions.
Class Normalization improves zero-shot learning models.
problem Improving zero-shot learning models in a continual setting.
method Class Normalization (CN) technique to address irregular loss surfaces and improve training efficiency.
result CN significantly outperforms state-of-the-art models on 4 standard ZSL datasets.
New bandit algorithms improve sparse reward learning.
problem Sparse rewards hinder learning efficiency in real-world bandit applications.
method Developed algorithms based on Upper Confidence Bound and Thompson Sampling for zero-inflated distributions.
result Empirical performance of new algorithms is superior to existing methods.
CyBeR-0 optimizes federated learning with Byzantine resilience and reduced communication costs.
problem Byzantine attacks and communication inefficiency in federated learning.
method Transformed robust aggregation for zero-order optimization under client heterogeneity.
result CyBeR-0 achieves stable performance with minimal communication costs and reduced memory usage.
Gradient descent learns ReLU functions with non-zero bias efficiently.
problem Learning ReLU functions with non-zero bias under Gaussian distributions.
method Gradient descent starting from random initialization.
result Gradient descent achieves near-optimal error with high probability.
Aggregates diverse zero-shot LLM outputs for better corporate disclosure classification.
problem Combining varied zero-shot LLM predictions for improved stock return prediction.
method Multi-prompt framework with three fixed zero-shot LLM classifiers, logistic meta-classifier aggregation.
result Aggregated model outperforms single classifiers and baseline models, increasing balanced accuracy from 0.566 to 0.606.
Despite the advancement of supervised image recognition algorithms, their dependence on the availability of labeled data and the rapid expansion of image categories raise the significant challenge of zero-shot learning. Zero-shot learning (ZSL) aims to transfer knowledge from labeled classes into unlabeled classes to r…
ZegOT uses optimal transport to zero-shot segment images with text prompts.
problem Zero-shot semantic segmentation with limited image-text alignment knowledge.
method ZegOT uses optimal transport to match multiple text prompts with frozen image embeddings.
result ZegOT achieves state-of-the-art performance in zero-shot semantic segmentation.
Paper explores using LLMs for zero-shot reinforcement learning in continuous spaces.
problem Leveraging LLMs for continuous state spaces in reinforcement learning.
method Disentangled In-Context Learning (DICL) to handle multivariate data and control signal.
result DICL produces well-calibrated uncertainty estimates in reinforcement learning settings.
Paper studies competitive networks where teams aim to minimize their own objectives, adapting to each other's strategies.
problem Competitive networks where teams have conflicting objectives.
method Proposes diffusion learning algorithms for two classes of network games: zero-sum and non-zero-sum.
result Stability performance of proposed algorithms analyzed and demonstrated through experiments.
Research tackles alliance formation in many-player zero-sum games, showing reinforcement learning fails but a contract mechanism can help.
problem Tackles the challenge of alliance formation in many-player zero-sum games.
method Demonstrates the social dilemma aspect of alliance formation, introduces a contract mechanism to augment reinforcement learning.
result Naïve reinforcement learning fails to form alliances, but a contract mechanism can help.
Zero-Shot learning has been shown to be an efficient strategy for domain adaptation. In this context, this paper builds on the recent work of Bucher et al. [1], which proposed an approach to solve Zero-Shot classification problems (ZSC) by introducing a novel metric learning based objective function. This objective fun…
MAIN network learns attributes without unseen class attributes for faster, more adaptable ZSL.
problem Learning unseen categories without known attributes and handling continual learning.
method Meta-learning attribute self-interaction network with inverse regularization.
result Main network outperforms state-of-the-art ZSL methods without unseen class attributes.
Raven's Progressive Matrices are one of the widely used tests in evaluating the human test taker's fluid intelligence. Analogously, this paper introduces geometric generalization based zero-shot learning tests to measure the rapid learning ability and the internal consistency of deep generative models. Our empirical re…
New assumptions and algorithm solve offline two-player zero-sum Markov games.
problem Solving offline two-player zero-sum Markov games under insufficient assumptions.
method Proposed unilateral concentration assumption and pessimism-type algorithm.
result Algorithm efficiently learns Nash equilibrium under unilateral concentration.
We present a generative framework for generalized zero-shot learning where the training and test classes are not necessarily disjoint. Built upon a variational autoencoder based architecture, consisting of a probabilistic encoder and a probabilistic conditional decoder, our model can generate novel exemplars from seen/…
In principle, zero-shot learning makes it possible to train a recognition model simply by specifying the category's attributes. For example, with classifiers for generic attributes like \emph{striped} and \emph{four-legged}, one can construct a classifier for the zebra category by enumerating which properties it posses…
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.
Paper introduces a flow-based framework for representation learning.
problem Capturing fine-grained structural details in complex data distributions.
method Zero-flow criterion for conditional independence and a tractable loss function.
result The zero-flow criterion enables learning of sufficient information from data.
Develops a cross-lingual hate speech detection model using pre-trained Transformers.
problem Detecting hate speech in low-resource languages.
method Utilizes frozen Transformer language models and AXEL attention-based classification block for zero-shot and few-shot learning.
result Demonstrates highly competitive results on English and Spanish subsets of the HatEval challenge.
Uncertainty sampling, a popular active learning algorithm, is used to reduce the amount of data required to learn a classifier, but it has been observed in practice to converge to different parameters depending on the initialization and sometimes to even better parameters than standard training on all the data. In this…
Study best-response learning dynamics in zero-sum polymatrix games under full and minimal information settings.
problem Learning dynamics in zero-sum polymatrix games under different information settings.
method Two-timescale learning dynamics combining smoothed best-response updates and TD-learning for estimating local payoff functions.
result Polynomial-time finite-sample guarantees for convergence to an ε-Nash equilibrium in the minimal information case.
A core novelty of Alpha Zero is the interleaving of tree search and deep learning, which has proven very successful in board games like Chess, Shogi and Go. These games have a discrete action space. However, many real-world reinforcement learning domains have continuous action spaces, for example in robotic control, na…
Meta-learning framework improves zero-shot time-series forecasting.
problem Improving generalization on new time series from different datasets.
method Broad meta-learning framework with residual connections as adaptation mechanism.
result Viable zero-shot univariate forecasting without retraining.
Proposes a new model to predict travel demand with zero-inflated and long-tail characteristics.
problem Sparse and long-tailed travel demand data with many zeros.
method Spatial-Temporal Tweedie Graph Neural Network (STTD) using Tweedie distribution.
result STTD provides accurate predictions and precise confidence intervals.
Proposes a new training algorithm for zero-sum games to avoid convergence issues.
problem Gradient-based training leads to weak convergence and cyclic dynamics in zero-sum architectures.
method Follow the perturbed leader algorithm with neural mediating agent.
result Guarantees convergence to mixed Nash equilibrium without cyclic behaviors.
Generalization and reliability of multilingual translation often highly depend on the amount of available parallel data for each language pair of interest. In this paper, we focus on zero-shot generalization---a challenging setup that tests models on translation directions they have not been optimized for at training t…
New algorithm optimizes positions of CountSketch non-zero entries for better data compression.
problem Optimizing positions of CountSketch non-zero entries for better data compression.
method Learning algorithm that optimizes both values and positions of CountSketch non-zero entries.
result Improves accuracy for low rank approximation and other problems like k-means clustering.