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,181 papers · 148 categories

Trend · papers per month

23466891 · Jun 202019922001200920182026
48 results for visual categorization

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.

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.

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.

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.

Report on enhancing trust in ML models with visualizations.

problem Understanding and trusting the results of black box ML models.
method Categorization of visualization techniques, statistical overview, topic analyses, and interactive web-based survey.
result Expanded categorization of trust against different facets of interactive ML.

DPERC efficiently estimates covariance matrices for mixed data with missing values.

problem Estimating covariance matrices for datasets with missing values and mixed features.
method Direct Parameter Estimation for Randomly Missing Data with Categorical Features (DPERC).
result DPERC outperforms other methods in estimating covariance matrices for mixed data with missing values.

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.

This paper extends rack and quandle covering theory using higher categorical Galois theory.

problem Developing a higher covering theory of racks and quandles.
method Applying techniques from higher categorical Galois theory to extend and clarify the foundations of rack and quandle coverings.
result Identification of meaningful higher-dimensional centrality conditions defining higher coverings of racks and quandles.

Fine-grained visual categorization (FGVC) is to categorize objects into subordinate classes instead of basic classes. One major challenge in FGVC is the co-occurrence of two issues: 1) many subordinate classes are highly correlated and are difficult to distinguish, and 2) there exists the large intra-class variation (e…

2014-02-03abs ↗pdf ↗

Topic models (e.g., pLSA, LDA, sLDA) have been widely used for segmenting imagery. However, these models are confined to crisp segmentation, forcing a visual word (i.e., an image patch) to belong to one and only one topic. Yet, there are many images in which some regions cannot be assigned a crisp categorical label (e.…

2016-12-28abs ↗pdf ↗

A framework for measuring differences in categorical data.

problem Measuring differences between categorical variables.
method Introduces a general framework for efficient and flexible implementation of distances for categorical variables.
result Framework allows for incorporation of existing distances and introduces new formulations.

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.

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 ↗

Method trains multi-modal policy from unlabeled mixed demonstrations.

problem Training policies from unlabeled mixed demonstrations.
method Variational autoencoder with categorical latent variable to discover latent factors of variation.
result Policy can reproduce specific behaviors by conditioning on categorical vectors.

Visualizes information flow in ML systems for better understanding and analysis.

problem Understanding the flow of information in complex ML systems.
method Proposes a visual approach using Sankey Diagrams to analyze flow of information.
result Demonstrates the effectiveness of the proposed technique in diagnosing model performance.

Improves neural network mapping functionality using latent feature generation.

problem Improving neural network performance in visual recognition tasks.
method Reversible learning for generating and learning latent features.
result The proposed method outperforms existing state-of-the-art methods in visual recognition.

We suggest a novel method of clustering and exploratory analysis of temporal event sequences data (also known as categorical time series) based on three-dimensional data grid models. A data set of temporal event sequences can be represented as a data set of three-dimensional points, each point is defined by three varia…

2015-05-06abs ↗pdf ↗

Layer-wise relevance propagation (LRP) is a recently proposed technique for explaining predictions of complex non-linear classifiers in terms of input variables. In this paper, we apply LRP for the first time to natural language processing (NLP). More precisely, we use it to explain the predictions of a convolutional n…

2016-06-23abs ↗pdf ↗

StructureBoost improves gradient boosting for complex categorical variables efficiently.

problem Efficiently handling complex categorical variables with known structure.
method Two methods to overcome computational obstacles in SCDT enumeration for structured categorical variables.
result StructureBoost outperforms existing packages on complex categorical problems.

Categorical bundles provide a natural framework for gauge theories involving multiple gauge groups. Unlike the case of traditional bundles there are distinct notions of triviality, and hence also of local triviality, for categorical bundles. We study categorical principal bundles that are product bundles in the categor…

2015-06-14abs ↗pdf ↗

Bayesian model improves categorization of explosions from sparse data.

problem Challenges in categorizing explosions from limited data.
method Bayesian update to Event Categorization Matrix model with Bayesian Decision Theory.
result Consistent gains in overall accuracy and lower false negative rates.

New method embeds RNN Seq2Seq models to visualize spatiotemporal data.

problem Visualizing and interpreting spatiotemporal data in sequence prediction tasks.
method Embedding approach to visualize and interpret RNN Seq2Seq model representations.
result Embedding space projections of RNN Seq2Seq models capture spatiotemporal dynamics.

UNTIE learns representations of coupled categorical data.

problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.

Paper introduces Categorical Normalizing Flows for better handling of categorical data.

problem Limited application of normalizing flows on categorical data due to lack of intrinsic order.
method Categorical Normalizing Flows use continuous transformations to model latent relations in categorical data, optimizing both continuous representation and model likelihood.
result GraphCNF, a permutation-invariant generative model, outperforms state-of-the-art on molecule generation.

A new method optimises problems with both continuous and categorical inputs.

problem Optimising black-box problems with mixed continuous and categorical inputs.
method Continuous and Categorical Bayesian Optimisation (CoCaBO) combining multi-armed bandits and Bayesian optimisation.
result CoCaBO outperforms existing methods on synthetic and real-world tasks.

The paper shows how integrating categorical semantics can enhance unsupervised domain translation.

problem Improving unsupervised domain translation between perceptually different domains.
method Learning invariant categorical semantic features in an unsupervised manner and conditioning them on the style encoder.
result Conditioning the style encoder on learned categorical semantics improves translation and stylization.

Categorical variables are a natural choice for representing discrete structure in the world. However, stochastic neural networks rarely use categorical latent variables due to the inability to backpropagate through samples. In this work, we present an efficient gradient estimator that replaces the non-differentiable sa…

2016-11-03abs ↗pdf ↗