We present Fashion-MNIST, a new dataset comprising of 28x28 grayscale images of 70,000 fashion products from 10 categories, with 7,000 images per category. The training set has 60,000 images and the test set has 10,000 images. Fashion-MNIST is intended to serve as a direct drop-in replacement for the original MNIST dat…
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.
168,742 papers · 148 categories
Trend · papers per month
48 results for “fashion MNIST”
MNIST and Fashion MNIST are extremely popular for testing in the machine learning space. Fashion MNIST improves on MNIST by introducing a harder problem, increasing the diversity of testing sets, and more accurately representing a modern computer vision task. In order to increase the data quality of FashionMNIST, this …
q-CNN learns data features through entangled states.
problem Classifying MNIST and Fashion MNIST datasets.
method Introduces q-CNN model, a tensor network description, and studies entanglement structure.
result q-CNN learns entanglement structure to perform classification tasks accurately.
New bounds for shallow neural networks with deterministic parameters.
problem Developing generalisation bounds for shallow neural networks.
method PAC-Bayesian theory applied to shallow neural networks with deterministic parameters.
result Empirical non-vacuous bounds for shallow neural networks trained with vanilla SGD.
Bidirectional VAE reduces parameters and improves image tasks.
problem Improving image reconstruction, classification, interpolation, and generation.
method Uses a single neural network for both encoding and decoding in both forward and backward directions.
result Bidirectional VAEs reduce parameters by almost 50% and slightly outperform unidirectional VAEs.
Tensor methods improve image classification performance.
problem Improving image classification accuracy using tensor-based machine learning.
method Two novel tensor-based approaches: MANDy kernel reformulation and alternating ridge regression in tensor-train format.
result Tensor-based methods are competitive with state-of-the-art neural networks.
The impact of the maximally possible batch size (for the better runtime) on performance of graphic processing units (GPU) and tensor processing units (TPU) during training and inference phases is investigated. The numerous runs of the selected deep neural network (DNN) were performed on the standard MNIST and Fashion-M…
FIS-GAN uses importance sampling in GANs to speed up training.
problem Efficiency in GAN training by focusing on hard-to-generate examples.
method Adapting importance sampling into GANs using normalizing flows.
result Significant acceleration in GAN optimization with improved fidelity.
Quantum computing at room temperature achieves high accuracy in image classification.
problem Classifying images with single photons at room temperature.
method Optical transformation of quantum state to exploit interference and entanglement.
result Theoretical accuracy of 41.27% for MNIST and 36.14% for Fashion-MNIST.
Improved image reconstruction using VAEs with Student's t-prior.
problem Improving the robustness of VAEs in image reconstruction.
method Proposed a VAE with Student's t-distribution as prior, trained all distribution parameters.
result Better image reconstruction achieved with Student's t-prior compared to Gaussian priors.
The paper applies Information Bottleneck theory to CNNs and finds compression phase not always present.
problem Understanding the behavior of convolutional neural networks.
method Employed Information Bottleneck theory to analyze CNNs.
result Compression phase not observed in all CNN cases.
A conceptually simple way to classify images is to directly compare test-set data and training-set data. The accuracy of this approach is limited by the method of comparison used, and by the extent to which the training-set data cover configuration space. Here we show that this coverage can be substantially increased u…
Recently, the posit numerical format has shown promise for DNN data representation and compute with ultra-low precision ([5..8]-bit). However, majority of studies focus only on DNN inference. In this work, we propose DNN training using posits and compare with the floating point training. We evaluate on both MNIST and F…
New method improves domain generalization by matching object representations.
problem Existing domain generalization methods fail to generalize to unseen domains.
method Proposes matching-based algorithms to match object representations across domains.
result MatchDG algorithm matches ground-truth object representations and improves out-of-domain accuracy.
We propose a GAN design which models multiple distributions effectively and discovers their commonalities and particularities. Each data distribution is modeled with a mixture of generator distributions. As the generators are partially shared between the modeling of different true data distributions, shared ones ca…
We characterize convolutional neural networks with respect to the relative amount of features per layer. Using a skew normal distribution as a parametrized framework, we investigate the common assumption of monotonously increasing feature-counts with higher layers of architecture designs. Our evaluation on models with …
Defense against small image patches using occlusions.
problem Vulnerability of deep learning to small adversarial patches.
method Partially occlude image around each patch location.
result Certified security against patch attacks of a certain size.
New supervised and unsupervised NFLTs for elliptical distributions.
problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.
Faster Tsetlin Machines use clause indexing to speed inference and learning.
problem Overfitting and slow inference in Tsetlin Machines.
method Introduced a look-up table that indexes clauses based on feature falsification, enabling faster evaluation of clauses.
result Up to 15 times faster classification and three times faster learning on MNIST and Fashion-MNIST.
Generative models are known to be difficult to assess. Recent works, especially on generative adversarial networks (GANs), produce good visual samples of varied categories of images. However, the validation of their quality is still difficult to define and there is no existing agreement on the best evaluation process. …
New metrics help rebuild trust in Active Learning for industry practitioners.
problem Misalignment of objectives between research and industry in Active Learning.
method Presentation of actionable metrics to interpret AL strategies.
result Actionable metrics improve AL performance and interpretability.
In the following paper we present a new type of optimization algorithms adapted for neural network training. These algorithms are based upon sequential operator splitting technique for some associated dynamical systems. Furthermore, we investigate through numerical simulations the empirical rate of convergence of these…
We propose a stepsize adaptation scheme for stochastic gradient descent. It operates directly with the loss function and rescales the gradient in order to make fixed predicted progress on the loss. We demonstrate its capabilities by conclusively improving the performance of Adam and Momentum optimizers. The enhanced op…
Symmetry of neural network densities can be determined from correlation functions.
problem Determining symmetries of neural network densities without knowing the density itself.
method Symmetry-via-duality approach using invariance properties of correlation functions.
result Symmetries of neural network densities can be determined via dual computations of correlation functions.
The paper introduces a method to make neural networks more robust to adversarial attacks.
problem Vulnerability of deep neural networks to small, adversarially designed perturbations.
method A bottom-up strategy using a nonlinear front end that polarizes and quantizes data.
result The approach can completely eliminate adversarial perturbations on MNIST and Fashion MNIST datasets.
We present a variation of the Autoencoder (AE) that explicitly maximizes the mutual information between the input data and the hidden representation. The proposed model, the InfoMax Autoencoder (IMAE), by construction is able to learn a robust representation and good prototypes of the data. IMAE is compared both theore…
Paper tackles unsupervised learning of 3D shapes from single images.
problem Learning 3D shapes from single images without supervision.
method Generative models, variational auto-encoders, adversarial methods.
result Model learns 3D shapes and poses from single images, showing potential for various datasets.
In recent years, Generative Adversarial Networks (GANs) have drawn a lot of attentions for learning the underlying distribution of data in various applications. Despite their wide applicability, training GANs is notoriously difficult. This difficulty is due to the min-max nature of the resulting optimization problem an…
Inspired by coarse-graining approaches used in physics, we show how similar algorithms can be adapted for data. The resulting algorithms are based on layered tree tensor networks and scale linearly with both the dimension of the input and the training set size. Computing most of the layers with an unsupervised algorith…
We demonstrate the use of tensor networks for image classification with the TensorNetwork open source library. We explain in detail the encoding of image data into a matrix product state form, and describe how to contract the network in a way that is parallelizable and well-suited to automatic gradients for optimizatio…
Adaptive Bayesian method improves deep learning performance and robustness.
problem Ensuring sparsity in deep learning models to improve performance and robustness.
method Adaptive empirical Bayesian method with self-adaptive spike-and-slab priors and stochastic gradient MCMC optimization.
result The method achieves state-of-the-art performance on MNIST and Fashion MNIST and compression performance on CIFAR10.
New method learns sparse distributions by thresholding samples, improving performance and efficiency.
problem Sparse coding optimization in high-dimensional problems is computationally expensive and inefficient.
method Proposes a new variational sparse coding approach that learns sparse distributions by thresholding samples.
result Shows superior performance, statistical efficiency, and gradient estimation compared to other sparse distributions.
Learning disentangled representation from any unlabelled data is a non-trivial problem. In this paper we propose Information Maximising Autoencoder (InfoAE) where the encoder learns powerful disentangled representation through maximizing the mutual information between the representation and given information in an unsu…
New research shows Multi-Task Learning does not behave like Multi-Objective Optimization.
problem Applying MOO methods to MTL problems is not equivalent.
method Comparing MTL and MOO approaches on Multi-Fashion-MNIST datasets.
result A single model can perform as well as optimizing multiple objectives.
Renormalized pruning improves neural network accuracy.
problem Over-parameterized neural networks waste many parameters.
method Propose renormalizing sparse neural networks.
result Renormalized pruning converges to zero error.
We investigate probabilistic decoupling of labels supplied for training, from the underlying classes for prediction. Decoupling enables an inference scheme general enough to implement many classification problems, including supervised, semi-supervised, positive-unlabelled, noisy-label and suggests a general solution to…
Modified neural network enhances unsupervised anomaly detection.
problem Unsupervised anomaly detection in multimodal data.
method Neural network with modified random projection outlyingness.
result Performance comparable to state-of-the-art methods.
One-Shot Learning using Mixture of Variational Autoencoders: a Generalization Learning approachcs.CV
Deep learning, even if it is very successful nowadays, traditionally needs very large amounts of labeled data to perform excellent on the classification task. In an attempt to solve this problem, the one-shot learning paradigm, which makes use of just one labeled sample per class and prior knowledge, becomes increasing…
This study compares two methods for uncertainty estimation in CNNs, finding Conformal Prediction more reliable.
problem CNNs often overestimate uncertainty, leading to unreliable predictions.
method Bayesian approximation via Monte Carlo Dropout and Conformal Prediction.
result Conformal Prediction produces more reliable uncertainty estimates than Monte Carlo Dropout.
Computing the Wasserstein barycenter of a set of probability measures under the optimal transport metric can quickly become prohibitive for traditional second-order algorithms, such as interior-point methods, as the support size of the measures increases. In this paper, we overcome the difficulty by developing a new ad…
Nested learning improves model performance on multi-granular tasks.
problem Overconfident models and lack of fine-grained confidence in predictions.
method Introducing nested learning with a sequence of nested feature embeddings and explicit combination of outputs.
result Nested learning outperforms standard end-to-end training on various datasets.
Dropout controls model capacity in deep learning and matrix completion.
problem Controlling model capacity in deep learning and matrix completion problems.
method Investigates dropout's effect on model capacity and Rademacher complexity.
result Dropout induces a regularizer that controls model capacity in expectation.
We propose a neural network based approach for extracting models from dynamic data using ordinary and partial differential equations. In particular, given a time-series or spatio-temporal dataset, we seek to identify an accurate governing system which respects the intrinsic differential structure. The unknown governing…
We give a new algorithm for approximating the Discrete Fourier transform of an approximately sparse signal that has been corrupted by worst-case noise, namely a bounded number of coordinates of the signal have been corrupted arbitrarily. Our techniques generalize to a wide range of linear transformations that are…
The MEM method uses data-driven priors for linear inverse problems, proving convergence and estimating differences.
problem Linear inverse problems with approximate priors.
method Maximum Entropy on the Mean (MEM) method with data-driven priors.
result Empirical mean convergence and estimates for prior differences based on epigraphical distance.
Study shows dataset properties impact adversarial machine learning robustness.
problem Vulnerability of DNNs to adversarial attacks.
method Examined five datasets, analyzed input size and contrast effects.
result Input size and contrast significantly influence adversarial success.
We address the problem of one-to-many mappings in supervised learning, where a single instance has many different solutions of possibly equal cost. The framework of conditional variational autoencoders describes a class of methods to tackle such structured-prediction tasks by means of latent variables. We propose to in…
This paper addresses the issue of building a part-based representation of a dataset of images. More precisely, we look for a non-negative, sparse decomposition of the images on a reduced set of atoms, in order to unveil a morphological and interpretable structure of the data. Additionally, we want this decomposition to…