[HTML][HTML] Text classification algorithms: A survey

K Kowsari, K Jafari Meimandi, M Heidarysafa, S Mendu… - Information, 2019 - mdpi.com
In recent years, there has been an exponential growth in the number of complex documents
and texts that require a deeper understanding of machine learning methods to be able to …

A survey on hyperdimensional computing aka vector symbolic architectures, part i: Models and data transformations

D Kleyko, DA Rachkovskij, E Osipov… - ACM Computing …, 2022 - dl.acm.org
This two-part comprehensive survey is devoted to a computing framework most commonly
known under the names Hyperdimensional Computing and Vector Symbolic Architectures …

Sparse, dense, and attentional representations for text retrieval

Y Luan, J Eisenstein, K Toutanova… - Transactions of the …, 2021 - direct.mit.edu
Dual encoders perform retrieval by encoding documents and queries into dense low-
dimensional vectors, scoring each document by its inner product with the query. We …

Accelerating large-scale inference with anisotropic vector quantization

R Guo, P Sun, E Lindgren, Q Geng… - International …, 2020 - proceedings.mlr.press
Quantization based techniques are the current state-of-the-art for scaling maximum inner
product search to massive databases. Traditional approaches to quantization aim to …

ASRO-DIO: Active subspace random optimization based depth inertial odometry

J Zhang, Y Tang, H Wang, K Xu - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
High-dimensional nonlinear state estimation is at the heart of inertial-aided navigation
systems (INS). Traditional methods usually rely on good initialization and find difficulty in …

Scaling provable adversarial defenses

E Wong, F Schmidt, JH Metzen… - Advances in Neural …, 2018 - proceedings.neurips.cc
Recent work has developed methods for learning deep network classifiers that are\emph
{provably} robust to norm-bounded adversarial perturbation; however, these methods are …

Statistical learning with sparsity

T Hastie, R Tibshirani… - Monographs on statistics …, 2015 - api.taylorfrancis.com
In this monograph, we have attempted to summarize the actively develo** field of
statistical learning with sparsity. A sparse statistical model is one having only a small …

One loss for quantization: Deep hashing with discrete wasserstein distributional matching

KD Doan, P Yang, P Li - … of the IEEE/CVF Conference on …, 2022 - openaccess.thecvf.com
Image hashing is a principled approximate nearest neighbor approach to find similar items
to a query in a large collection of images. Hashing aims to learn a binary-output function that …

Determinantal point processes for machine learning

A Kulesza, B Taskar - Foundations and Trends® in Machine …, 2012 - nowpublishers.com
Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that
arise in quantum physics and random matrix theory. In contrast to traditional structured …

[LIBRO][B] Foundations of data science

A Blum, J Hopcroft, R Kannan - 2020 - books.google.com
This book provides an introduction to the mathematical and algorithmic foundations of data
science, including machine learning, high-dimensional geometry, and analysis of large …