DeepMove learns place representations from large movement data.
problem Lack of movement context in traditional place representations.
method Directly models movements between places using deep learning.
result DeepMove outperforms state-of-the-art methods in place categorization and clustering.
We study a type of connection forms, given by Chen integrals, over pathspaces by placing such forms within a category-theoretic framework of principal bundles and connections. We introduce a notion of 'decorated' principal bundles, develop parallel transport on such bundles, and explore specific examples in the context…
Benchmarking AutoML for tables with text fields, achieving top performance.
problem Evaluating automated learning systems for tables with text fields.
method Publicly available benchmark with 18 datasets varying in size, types, and feature composition.
result Stack ensembling a multimodal Transformer with various tree models achieved top performance.
New method detects organized eCommerce fraud by clustering orders.
problem Detecting coordinated fraud by groups of fraudsters.
method Scalable categorical clustering using agglomerative clustering and sampling.
result Groups 35-45% of fraudulent orders together, detects 26.2% of fraud with low false alarms.
This paper shows using classification instead of regression improves deep RL scalability.
problem Challenges in training value functions for large networks in deep RL.
method Used categorical cross-entropy loss instead of mean squared error regression.
result Significant improvements in performance and scalability across various domains.
This primer explains diffusion models in general state spaces.
problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.
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…
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.
Text documents can be described by a number of abstract concepts such as semantic category, writing style, or sentiment. Machine learning (ML) models have been trained to automatically map documents to these abstract concepts, allowing to annotate very large text collections, more than could be processed by a human in …
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.
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.
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…
New algorithm recovers labels from noisy categorical data.
problem Recovering latent labels from noisy observations in structured instances.
method Approximate algorithm for graphs with categorical variables.
result Logarithmic dependency of Hamming error to the number of categories.
Study categorizes mutual funds using natural language processing from unstructured data.
problem Categorizing mutual funds using unstructured data for financial analysis.
method Used natural language processing models to classify mutual funds from their investment strategy descriptions.
result High accuracy in categorizing mutual funds using NLP from unstructured data.
Paper improves anomaly detection and categorization in multi-cloud environments.
problem Differentiating among different types of attacks for better defense.
method Used supervised machine learning techniques (LR and RF) on a public dataset.
result More than 99% detection accuracy and 93.6% categorization accuracy.
Develops 2-categorical methods for multi-parameter persistence.
problem Fundamental limitations of traditional persistence modules.
method 2-categorical structures to capture hierarchical interactions.
result New invariants effectively characterize multidimensional topological features.
Transforms classical connections using pushforwards and gauge transformations.
problem Transforming classical connections in categorical settings.
method Constructing pushforwards and applying gauge transformations to decorated path spaces.
result Combines traditional gauge transformation with affine translation.
The paper explores efficient ways to represent categorical data.
problem Wasteful one-hot encoding of categorical variables.
method Investigates alternative, lower-dimensional real-valued representations.
result Proposed methods retain all predictive information without one-hot encoding.
City2City translates place representations across cities using language translation techniques.
problem Lack of inter-city perspective in place representations from mobility data.
method Applied unsupervised machine language translation methods to translate place representations across different cities.
result Successfully translated place representations from one city to another, validated using landuse data.
CADM proposes a cluster-specific distance metric for categorical data clustering.
problem Inadequate distance metrics for categorical data, especially varying within clusters.
method Cluster-customized adaptive distance metric for categorical data.
result Achieved competitive performance in categorical data clustering.
Develops a new method for decision trees using categorical variable structure.
problem Lack of structure in treating categorical variables as predictors.
method Introduces a mathematical framework to represent categorical structure and generalizes decision trees to utilize this structure.
result Improves prediction accuracy on weather data using the new method.
Categorical d-separation criterion simplifies probability graph analysis.
problem Detecting causal relationships in probability distributions.
method Introducing categorical definitions for causal models and d-separation.
result Abstract version of d-separation criterion applies to various probability theories.
nTreeClus clusters categorical sequences using tree-based learners and k-mers.
problem Challenges in clustering categorical and sequential data.
method nTreeClus uses Tree-based Learners, k-mers, and autoregressive models for categorical time series.
result nTreeClus outperformed baseline methods in various validation metrics.
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.
A new gradient estimator for categorical distributions reduces bias and variance.
problem Intractability of gradients for categorical distributions in discrete latent variable models.
method CatLog-Derivative trick and IndeCateR gradient estimator.
result IndeCateR reduces bias and variance of gradients for categorical distributions.
Bayesian optimisation tackles high-dimensional categorical and mixed search spaces.
problem Bayesian optimisation on high-dimensional categorical and mixed search spaces is challenging.
method Combining local optimisation with a tailored kernel design.
result Empirically outperforms current baselines in performance and computational costs.
The article compares predictor importance in classification problems with categorical outcomes.
problem Comparing predictor importance in classification problems with categorical response variables.
method The approach is based on the categorical Gini correlation (CGC) and tests differences in CGCs across predictor groups.
result The proposed methodology accommodates predictors of arbitrary and unequal dimensions and allows for dependence between predictor groups.
Paper introduces new methods for modeling categorical data.
problem Training generative models on categorical data like text and segmentation.
method Argmax Flows and Multinomial Diffusion models.
result Models outperform existing methods in log-likelihood.
Study uses trajectory embedding to measure place function similarity at fine spatial granularity.
problem Measuring place function similarity at fine spatial granularity.
method Trajectory embedding to reduce dimensions and measure similarity of place functions.
result Embedding similarity can be a metric proxy for place functions at fine spatial granularity.
CPML efficiently learns new metrics for categorical data.
problem Metric learning for categorical data.
method CPML (categorical projected metric learning) using Schatten p-norms.
result CPML provides efficient metric learning with improved accuracy.
Abstract proposes a new categorical approach to quantization of Poisson algebras.
problem Quantization of Poisson algebras.
method Defining quantization categories as subcategories of R-module categories with classical limits.
result Categories of strict deformation quantization, prequantization, and matrix regularization are equivalent, while Poisson enveloping algebra is not.
A framework estimates categorical distributions under constraints, ensuring generality and uniqueness.
problem Estimating categorical distributions summarizing sample data under marginal constraints.
method Theoretical framework + Iterative Proportional Fitting (IPF) to estimate the distribution.
result A unique categorical distribution of Maximum Entropy under marginal constraints exists and is estimated.
Paper improves video categorization using temporal coherence.
problem Video categorization in multiple modalities.
method Temporal coherence-based regularization for multimodal models.
result Models with temporal coherence outperform state-of-the-art.
A new method for optimizing models with categorical variables using diffusion.
problem Optimizing models with categorical variables, especially in discrete distributions.
method Introducing ReDGE, a diffusion-based soft reparameterization method for categorical distributions.
result ReDGE consistently matches or outperforms existing gradient-based methods in experiments.
Natural Language Processing models help encode categorical process inputs.
problem Encoding categorical variables in industrial process modeling.
method Using NLP models for categorical variable encoding, combined with dimensionality reduction.
result Meaningful embeddings of categorical variables improve feature importance.
This study compares and evaluates categorical kernels for Gaussian process regression.
problem Challenges in designing effective categorical kernels for Gaussian process regression.
method Reproducible comparative study of existing kernels, new evaluation metrics, and clustering-based nested kernels.
result Nested kernels outperform other methods, especially when group structure is unknown or unknown.
A new method clusters categorical data by learning their optimal order and distance.
problem Clustering categorical data lacks a well-defined metric space.
method Order distance metric learning for categorical data.
result Superior clustering accuracy on categorical and mixed datasets.
Probabilistic learning for binary classification with categorical variables.
problem Binary classification with categorical covariates.
method Probabilistic analysis and two algorithms for learning boolean functions.
result Effective learning of boolean functions from binary data.
Proposes a new classifier for causal discovery in categorical data.
problem Causal discovery for categorical data.
method Classification with optimal label permutation (COLP) and simple learning algorithm.
result Favorable performance compared to state-of-the-art methods.
Enhances clustering by using external categorical data.
problem Improving clustering outcomes using external categorical evidence.
method Evidence transfer method that manipulates autoencoder latent representations based on external categorical data.
result Our method effectively manipulates latent representations with real evidence and remains robust with low quality evidence.
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.
We consider the problem of sequential learning from categorical observations bounded in [0,1]. We establish an ordering between the Dirichlet posterior over categorical outcomes and a Gaussian posterior under observations with N(0,1) noise. We establish that, conditioned upon identical data with at least two observatio…
The paper compares one-hot encoding to Naïve Bayes for categorical variables.
problem Incorrect one-hot encoding affects Naïve Bayes performance.
method Mathematical and experimental analysis of PoB vs. categorical Naïve Bayes.
result Posterior probabilities are usually greater in the PoB case, but agree on the maximum a posteriori class label.
CatBoost boosts performance on datasets with categorical features.
problem Handling categorical features in gradient boosting.
method Gradient boosting library with GPU and CPU implementations.
result Outperforms existing implementations on popular datasets.