Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

120240359479 · Jun 202019922001200920172026
48 results for CUB spaces

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…

2019-05-31abs ↗pdf ↗

Few-shot classification algorithms can alleviate the data scarceness issue, which is vital in many real-world problems, by adopting models pre-trained from abundant data in other domains. However, the pre-training process was commonly unaware of the future adaptation to other concept classes. We disclose that a classic…

2020-03-01abs ↗pdf ↗

We introduce the isoperimetric loss as a regularization criterion for learning the map from a visual representation to a semantic embedding, to be used to transfer knowledge to unknown classes in a zero-shot learning setting. We use a pre-trained deep neural network model as a visual representation of image data, a Wor…

2019-03-15abs ↗pdf ↗

In this paper, we propose a new method to overcome catastrophic forgetting by adding generative regularization to Bayesian inference framework. Bayesian method provides a general framework for continual learning. We could further construct a generative regularization term for all given classification models by leveragi…

2019-12-03abs ↗pdf ↗

LDA improves image classification accuracy with fewer features.

problem Fine-grained image classification with pretrained features.
method Supervised dimensionality reduction with LDA before linear probing.
result LDA improves accuracy over full features in 11 out of 12 configurations.

Generative Latent Implicit Conditional Optimization (GLICO) learns from small samples.

problem Learning from small labeled datasets.
method Generative Latent Implicit Conditional Optimization (GLICO) learns a latent space and generator from small labeled data.
result GLICO synthesizes new samples for every class using as few as 10 examples per class.

Generating an image from its description is a challenging task worth solving because of its numerous practical applications ranging from image editing to virtual reality. All existing methods use one single caption to generate a plausible image. A single caption by itself, can be limited, and may not be able to capture…

2018-09-20abs ↗pdf ↗

Two things seem to be indisputable in the contemporary deep learning discourse: 1. The categorical cross-entropy loss after softmax activation is the method of choice for classification. 2. Training a CNN classifier from scratch on small datasets does not work well. In contrast to this, we show that the cosine loss fun…

2019-01-25abs ↗pdf ↗

Generative adversarial networks (GANs) have shown outstanding performance on a wide range of problems in computer vision, graphics, and machine learning, but often require numerous training data and heavy computational resources. To tackle this issue, several methods introduce a transfer learning technique in GAN train…

2020-02-25abs ↗pdf ↗

Humans are able to explain their reasoning. On the contrary, deep neural networks are not. This paper attempts to bridge this gap by introducing a new way to design interpretable neural networks for classification, inspired by physiological evidence of the human visual system's inner-workings. This paper proposes a neu…

2017-10-26abs ↗pdf ↗

A key component of most neural network architectures is the use of normalization layers, such as Batch Normalization. Despite its common use and large utility in optimizing deep architectures, it has been challenging both to generically improve upon Batch Normalization and to understand the circumstances that lend them…

2019-06-09abs ↗pdf ↗

Few-shot learning algorithms aim to learn model parameters capable of adapting to unseen classes with the help of only a few labeled examples. A recent regularization technique - Manifold Mixup focuses on learning a general-purpose representation, robust to small changes in the data distribution. Since the goal of few-…

2019-07-28abs ↗pdf ↗

New Convolutional Unit improves Batch Whitening performance.

problem Improving the efficiency and effectiveness of Batch Whitening.
method Proposes a new Convolutional Unit that aligns with Batch Whitening theory and empirically analyzes the original Convolutional Unit.
result Significantly improved performance on multiple image classification datasets.

Gaussian Processes (GPs) are known to provide accurate predictions and uncertainty estimates even with small amounts of labeled data by capturing similarity between data points through their kernel function. However traditional GP kernels are not very effective at capturing similarity between high dimensional data poin…

2019-10-13abs ↗pdf ↗

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>100 imes).

DRAGON improves learning for rare classes in unbalanced datasets using class descriptions.

problem Learning rare classes in unbalanced datasets with deep models.
method DRAGON is a late-fusion architecture that corrects bias towards frequent classes and fuses class-descriptions to improve tail-class accuracy.
result DRAGON outperforms state-of-the-art models on new benchmarks for long-tail learning with class descriptors.

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.

Paper proposes a new pipeline for few-shot classification using forget-update module and channel vector sequence.

problem Few-shot classification with limited support samples.
method Channel vector sequence construction module and forget-update module.
result Pipeline achieves state-of-the-art results on various datasets.

Learning to classify unseen class samples at test time is popularly referred to as zero-shot learning (ZSL). If test samples can be from training (seen) as well as unseen classes, it is a more challenging problem due to the existence of strong bias towards seen classes. This problem is generally known as \emph{generali…

2019-09-10abs ↗pdf ↗

AdamP optimizes momentum-based optimizers for scale-invariant weights, improving model performance.

problem Premature decay of effective step sizes in momentum-based optimizers for scale-invariant weights.
method Proposes SGDP and AdamP to eliminate the radial component at each optimizer step, preserving convergence properties.
result Uniform gains across multiple benchmarks, improving model performance.

The distance function ϱ(p,q)\varrho(p,q) (or d(p,q)d(p,q)) of a distance space (general metric space) is not differentiable in general. We investigate such distance spaces over Rn\mathbb R^n, whose distance functions are differentiable like in case of Finsler spaces. These spaces have several good properties, yet they are no F…

2015-05-26abs ↗pdf ↗

In a paper (math.DG/0403528) we obtained explicit examples of Moishezon twistor spaces of some compact self-dual four-manifolds admitting a non-trivial Killing field, and also determined their moduli space. In this note we investigate minitwistor spaces associated to these twistor spaces. We determine their structure, …

2005-08-04abs ↗pdf ↗

Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.

problem Understanding geometric relationships between complex hyperbolic spaces and Hilbert spaces.
method Use a complex analog of the cosine of a vertex angle as a novel technical tool.
result Describe possible triangular faces of tetrahedra in hyperbolic space and three-dimensional subspaces in Hilbert spaces with Pick kernels.

Study of complete space-like self-expanders in Minkovski space.

problem Characterize complete space-like self-expanders in Minkovski space.
method Use of maximum principle of Omori-Yau type to prove rigidity theorems.
result Classification of 2-dimensional complete space-like self-expanders with constant squared norm of the second fundamental form.