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.

169,341 papers · 148 categories

Trend · papers per month

24487195 · Oct 201919922001200920182026
48 results for visual categories

A hybrid approach links fMRI data to deep features for visual category decoding.

problem Lack of practical fMRI decoder with CNN structure due to limited brain data.
method Kernel Canonical Correlation Analysis linking fMRI and deep learnt representations.
result Effective in distinguishing semantic visual categories using only brain imaging data.

Automated method selects eye tracking variables for categorization tasks.

problem Limited duration of infant cooperation and biases in handpicked eye tracking variables.
method Automated selection of eye tracking variables using statistical techniques.
result Same eye tracking variables classify category learners from non-learners in adults and infants with high accuracy.

Prototype-based memory network learns visual categories from unlabeled data.

problem Learning from nonstationary, unlabeled data with sequential dependencies.
method Online prototype-based memory network with contrastive loss.
result Significantly better category recognition compared to state-of-the-art methods.

Study shows perceptual boost of visual attention varies with task difficulty and size.

problem Understanding how task-dependent the perceptual boost of visual attention is in natural settings.
method Designed and trained neural networks on various visual tasks, comparing results to baseline.
result Perceptual boost of attention is stronger with more difficult tasks and weaker with larger task sets.

Adaptive system diversifies and personalizes visual browsing for better user engagement.

problem Poor performance of search queries in ambiguous or inspirational browsing scenarios.
method Bayesian regression for scoring relevance, submodular diversification, and personalized category preferences learned from user behavior.
result Significant improvement in click-through-rate and session duration on live traffic.

Teaches categories with visual explanations to improve learning.

problem Challenges of traditional machine teaching methods in providing clear explanations.
method Proposes a teaching framework that provides interpretable explanations as feedback.
result Participants achieve better test set performance with interpretable explanations.

People can learn complex visual concepts from just a few examples.

problem Understanding how people learn and categorize visual concepts from limited data.
method Bayesian program learning model that searches for the best explanation of observations.
result People's judgments are broadly consistent with a Bayesian program learning model, indicating they can learn rich algorithmic abstractions from sparse input data.

This paper analyzes interactive model analysis for machine learning.

problem Understanding, diagnosing, and refining machine learning models.
method Classification of relevant work into understanding, diagnosis, and refinement categories.
result Exploration of future research opportunities in interactive model analysis.

The output scores of a neural network classifier are converted to probabilities via normalizing over the scores of all competing categories. Computing this partition function, ZZ, is then linear in the number of categories, which is problematic as real-world problem sets continue to grow in categorical types, such as …

2015-08-07abs ↗pdf ↗

Improved vision-language embeddings boost cross-task learning.

problem Creating general vision systems with better cross-task learning.
method Aligning image-word representations for better cross-task transfer.
result Improved inductive transfer from visual recognition to visual question answering.

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…

2014-09-15abs ↗pdf ↗

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.

Large dataset of e-retailer images for improving visual search and product classification.

problem Improving the relevancy of visual search and product recommendation systems.
method Sharing a large dataset of 12M images from an online store classified into 5K categories.
result Demonstrates the effectiveness of deep learning in image classification.

Novel model for decoding visual stimuli in human brains.

problem Challenges in MVP techniques, including noise and sparsity, and the cost of brain studies.
method Automatic detection of active regions, new Gaussian smoothing method, combining fMRI data sets.
result Superior performance compared to state-of-the-art methods.

We explore visual representations of tilings corresponding to Schläfli symbols. In three dimensions, we call these tilings "honeycombs". Schläfli symbols encode, in a very efficient way, regular tilings of spherical, euclidean and hyperbolic spaces in all dimensions. In three dimensions, there are only a finite number …

2015-11-08abs ↗pdf ↗

This paper proposes a method to reduce complexity in GLMs with categorical predictors.

problem Wasteful, hard-to-interpret, and prone to overfitting of traditional one-hot encoding for high-cardinality categorical predictors.
method Clustering categories of categorical predictors through a numerical method that preserves or improves accuracy while reducing the number of coefficients.
result Clustering categories of categorical predictors reduces complexity substantially without harming accuracy.

C Croke and B Kleiner have constructed an example of a CAT(0) group with more than one visual boundary. J Wilson has proven that this same group has uncountably many distinct boundaries. In this article we prove that the knot group of any connected sum of two non-trivial torus knots also has uncountably many distinct C…

2007-06-11abs ↗pdf ↗

The paper tackles confidence calibration for exploratory machine learning problems.

problem Difficulty in curating datasets and confusion about category validity.
method Introduces four new algorithms for category-specific confidence estimation, including kernel density ratios.
result Kernel density ratios provide a novel approach to confidence calibration, especially for exploratory problems.

Unsupervised method discovers object landmarks by factorizing image deformations.

problem Learning object structure in unsupervised settings.
method Factorizing image deformations to learn landmarks consistently across different viewpoints and object deformations.
result Learned landmarks establish meaningful correspondences between different object instances without explicit requirement.

cGAP visualizes high-dimensional categorical data with interpretable geometric structure.

problem Lack of visualization tools for high-dimensional categorical data.
method cGAP uses Homogeneity Analysis (HOMALS) to embed data in a 3D space and maps it to colors.
result cGAP reveals coherent clusters, outliers, and local-to-global structure in categorical data.

cGAP visualizes high-dimensional categorical data with interpretable geometric structure.

problem Lack of visualization tools for high-dimensional categorical data.
method cGAP uses Homogeneity Analysis (HOMALS) to embed data in a 3D space and maps it to colors for visualization.
result cGAP reveals coherent clusters, outliers, and local-to-global structure in categorical data.

Compared to machines, humans are extremely good at classifying images into categories, especially when they possess prior knowledge of the categories at hand. If this prior information is not available, supervision in the form of teaching images is required. To learn categories more quickly, people should see important…

2015-04-28abs ↗pdf ↗

G-SimCLR improves unsupervised learning by clustering images into pseudo labels.

problem Improving unsupervised learning for image recognition.
method Proposes a method to cluster images into pseudo labels to batch images of the same category.
result Comparable performance enhancements on CIFAR10 and ImageNet datasets.

Proposes a method for weakly-supervised object localization to improve few-shot learning.

problem Challenges of few-shot learning, especially with fine-grained categories.
method Introduces a Self-Attention Based Complementary Module (SAC Module) for weakly-supervised object localization.
result Significantly outperforms state-of-the-art methods on benchmark datasets, especially for fine-grained few-shot tasks.

Paper tackles cross-granularity few-shot learning with meta-embedder.

problem Few-shot learning with coarse labels and fine-grained testing.
method Meta-embedder that optimizes visual and semantic discrimination across coarse and fine classes.
result Meta-embedder achieves effective cross-granularity few-shot classification.