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

3.2%6.4%9.6%12.7% · Jan 201919922001200920182026
48 results for object categorization

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.

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.

Discrete-AIR model identifies objects in images with interpretable latent codes.

problem Identifying objects in images without labeled data.
method Recurrent Auto-Encoder with structured latent distributions for discrete, continuous, and spatial attention.
result Discrete-AIR model uses minimal latent variables for efficient inference.

InfoCatVAE learns disentangled representations for categorical data.

problem Learning disentangled representations for categorical data.
method InfoCatVAE uses multimodal distributions and maximizes the ELBO objective, connecting it to a soft clustering objective.
result Improved model with mutual information maximization.

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 ↗

Improves BO methods for categorical and integer-valued variables.

problem Handling categorical and integer-valued variables in BO with GPs.
method Proposes a principled approach to encode categorical and integer-valued inputs.
result Significantly improves BO results on problems with categorical or integer-valued variables.

Local-HDP learns independent topics for each 3D object category in real-time.

problem Learning independent topics for each 3D object category in real-time.
method Local-Hierarchical Dirichlet Process (Local-HDP) with online variational inference.
result Local-HDP outperforms other approaches in accuracy, scalability, and memory efficiency.

A new, efficient kk-modes algorithm improves clustering of categorical data.

problem Clustering categorical data using existing methods like kk-means is inefficient.
method Developed a novel kk-modes algorithm called OTQT, which improves on existing methods.
result OTQT finds more accurate clusters per iteration and is faster overall.

Develops methods for clustering hypergraphs with categorical edge labels.

problem Complex graph representations with multiple interaction types.
method Combinatorial objective function, polynomial-time algorithm for two types, linear programming relaxations for more types.
result Efficient algorithms for clustering hypergraphs with categorical edge labels.

Study extends cognitive modeling to natural images, revealing the importance of image representation.

problem Extending cognitive modeling to natural images and understanding human categorization.
method Conducted a large-scale study with over 500,000 human judgments. Used deep and shallow machine learning methods to represent images. Applied psychological models of categorization to natural images.
result Simple models with abstract prototypes outperform complex exemplar accounts when using expressive, data-driven image representations.

New algorithm for clustering categorical data without using distance measures.

problem Challenges in clustering categorical data due to its unordered structure.
method Developed a Matching based clustering algorithm using a similarity matrix and feature importance criteria.
result The algorithm can serve as an alternative to existing clustering methods for categorical data.

A new method for categorical variational inference using discrete normalizing flows.

problem Challenges in optimizing variational approximations for discrete latent variables.
method Differentiable reparameterization using a mixture of discrete normalizing flows.
result Improves optimization of evidence lower bound and reduces sensitivity to hyperparameters.

We define the thin fundamental categorical group P2(M,){\mathcal P}_2(M,*) of a based smooth manifold (M,)(M,*) as the categorical group whose objects are rank-1 homotopy classes of based loops on MM, and whose morphisms are rank-2 homotopy classes of homotopies between based loops on MM. Here two maps are rank-nn homotop…

2007-10-23abs ↗pdf ↗

New approach categorizes objective functions for embodied agents.

problem Understanding how objectives relate to each other and discovering new objectives.
method Introducing Action Perception Divergence (APD) to categorize objective functions.
result Introduces a spectrum of objectives from narrow to general, explaining various unsupervised objectives.

VAIOM models financial returns using continuous input and categorical output.

problem Modeling continuous, noisy, and heterogeneous financial data.
method VAIOM is a decoder-only Transformer that separates input representation from output likelihood.
result VAIOM models outperform fixed single-bar LightGBM baseline in both Test halves.

Paper proposes PP-GCN for fine-grained social event categorization.

problem Challenges in mining social events due to heterogeneous event elements and social network structures.
method Design an event meta-schema, build an HIN, propose PP-GCN, and use KIES.
result PP-GCN outperforms other techniques in social event detection and clustering.

SCOPE fuses categorical variable levels to estimate high-dimensional linear models.

problem Estimating high-dimensional linear models with nominal categorical data.
method SCOPE uses nonconvex concave penalties to fuse levels and achieve efficient computation.
result SCOPE achieves oracle least squares solution under certain conditions.

New optimization algorithm for mixed-variable problems improves efficiency.

problem Optimizing functions with both continuous and categorical variables.
method Combines radial basis function and metric stochastic response surface methods with modifications for categorical variables and parallel processing.
result Numerical experiments show the effectiveness of the proposed modifications.

The trace of the affine Hecke category is compared with the elliptic Hall algebra.

problem Comparing the trace of the affine Hecke category with the elliptic Hall algebra.
method Using Wakimoto objects and Rouquier complexes, the trace is generated by objects EextbfdE_{ extbf{d}}.
result The trace of the affine Hecke category yields an integral form A~\widetilde{\mathcal{A}} of the elliptic Hall algebra.

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 ↗

A new method for optimizing functions with both categorical and continuous variables.

problem Optimizing functions with mixed categorical and continuous variables.
method Formulates as a multi-armed bandit problem, uses Thompson sampling, extends to batch BO.
result Proves sub-linear regret bounds and demonstrates effectiveness on various benchmarks.

A scalable algorithm compresses large categorical feature vocabularies while maximizing mutual information.

problem Learning from categorical features with very large vocabularies.
method Submodular optimization to maximize mutual information between compressed feature and target labels.
result The algorithm achieves a 63% approximation of the global optimal solution for mutual information.

This work tackles robust optimization with multiple objectives for structural design.

problem Optimizing structural design under uncertainty for multiple conflicting objectives.
method Adaptive surrogate modeling using Kriging to approximate computationally expensive models.
result The importance of replacing the heating system in building renovations is highlighted.

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.

The paper defines and studies the category of Z-graded manifolds, including their intrinsic structure and formal properties.

problem Understanding the categorical properties and intrinsic structure of Z-graded manifolds.
method Describing local models, explaining formality, and formulating analogues of theorems.
result Proper definitions of objects and morphisms in the category of Z-graded manifolds, and formulation of Batchelor's theorem.

A new method for generative modeling of discrete data using geometric latent subspaces.

problem Learning generative models for discrete data with statistical dependencies.
method Geometric latent-subspace framework in exponential parameter space of product manifolds of categorical distributions.
result Low-dimensional latent space encodes statistical dependencies and accurately models high-dimensional discrete data.

Unified discrete diffusion for categorical data simplifies training and sampling.

problem Training and sampling in discrete diffusion models for categorical data.
method Mathematical simplifications and elegant unification of discrete-time and continuous-time discrete diffusion.
result Unified Simplified Discrete Denoising Diffusion (USD3) outperforms SOTA baselines.

We reformulate superalgebra and supergeometry in completely categorical terms by a consequent use of the functor of points. The increased abstraction of this approach is rewarded by a number of great advantages. First, we show that one can extend supergeometry completely naturally to infinite-dimensional contexts. Seco…

2008-02-27abs ↗pdf ↗