New handwritten digits dataset for Kannada script.
problem Lack of datasets for Kannada numeral digits.
method Developed Kannada-MNIST and Dig-MNIST datasets.
result Initial CNN accuracy is lower than MNIST, indicating a challenge in generalization.
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,051 papers · 148 categories
Trend · papers per month
48 results for “MNIST digits”
Reconstructs lost MNIST dataset to validate previous findings.
problem Lost precise derivation steps of MNIST dataset.
method Trace each MNIST digit to NIST source, reconstruct complete test set.
result Reconstructed MNIST dataset confirms previous findings on classifier performance.
TDA classifies MNIST digits with reduced feature set.
problem Classifying MNIST digits using machine learning.
method Persistent homology for feature generation and classification.
result 5x reduction in feature set size with similar accuracy.
New neuromorphic hardware learns MNIST digits efficiently.
problem Limited scalability and in-hardware learning in existing neuromorphic hardware.
method Low-cost scalable NoC-based SNN architecture with in-hardware STDP learning.
result Demonstrated learning capability of the hardware architecture.
AWDO trains neural networks for digit classification.
problem Training feedforward neural networks.
method Adaptive Wind Driven Optimization (AWDO).
result AWDO outperforms steepest descent method in digit classification.
Investigates the impact of batch size on GPU and TPU performance.
problem Optimizing performance of GPUs and TPUs during training and inference phases.
method Investigated the impact of batch size on performance of GPUs and TPUs using standard MNIST and Fashion-MNIST datasets.
result Significant speedup was achieved even with low-scale usage of TPUv2 units, up to 10x for training and 2x for prediction.
Study on neural networks to identify redundancy issues in safe machine learning.
problem Identifying redundancy in neural network architectures for safe machine learning.
method Experiments with MNIST database using neural network classifiers.
result Underlines difficulties in using neural network classifiers for safe systems.
We propose a data-driven framework for optimizing privacy-preserving data release mechanisms to attain the information-theoretically optimal tradeoff between minimizing distortion of useful data and concealing specific sensitive information. Our approach employs adversarially-trained neural networks to implement random…
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.
We propose a simple kernel based nearest neighbor approach for handwritten digit classification. The "distance" here is actually a kernel defining the similarity between two images. We carefully study the effects of different number of neighbors and weight schemes and report the results. With only a few nearest neighbo…
This study examines how hidden layers affect CNN performance on handwritten digit recognition.
problem Impact of hidden layers on CNN performance in handwritten digit recognition.
method Applied CNN with varying hidden layers on MNIST dataset, trained with stochastic gradient and backpropagation, tested with feedforward.
result Variations in accuracies for different hidden layers and epochs.
Neural networks have shown great potential in many applications like speech recognition, drug discovery, image classification, and object detection. Neural network models are inspired by biological neural networks, but they are optimized to perform machine learning tasks on digital computers. The proposed work explores…
Method discovers symmetries in data with neural networks.
problem Discovering symmetries in high-dimensional data.
method Fully connected neural networks trained with a loss function for symmetry.
result Generators for symmetries in latent space.
A model separates visual style from digit type on MNIST and facial features from shape on CelebA.
problem Learning compact, independent factors of data.
method Explicitly encoded in a generative model with two latent spaces: spatial transformations and intrinsic appearance.
result The model separates visual style from digit type on MNIST and facial features from shape on CelebA.
The Tree-SNE Tree Existsstat.ML
A new method, tree-SNE, solves the scale problem in t-SNE.
problem Clustering and visualizing high-dimensional data, especially MNIST digits.
method Revisits t-SNE idea to create a 2+1 dimensional embedding with a scale parameter.
result The optimal embedding depends continuously on the scale parameter for all initial conditions.
InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscs.LG
This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn disentangled representations in a completely unsupervised manner. InfoGAN is a generative adversarial network that also maximizes the mutual information between a small subset of the latent varia…
A new Multi-Stream VAE separates multiple sources in images and audio.
problem Learning disentangled representations in multi-stream data.
method Combines discrete and continuous latent spaces for source separation.
result Competitive performance in separating superimposed digits and sound sources.
We describe a novel spiking neural network (SNN) for automated, real-time handwritten digit classification and its implementation on a GP-GPU platform. Information processing within the network, from feature extraction to classification is implemented by mimicking the basic aspects of neuronal spike initiation and prop…
Deep Belief Networks (DBN) have been successfully applied on popular machine learning tasks. Specifically, when applied on hand-written digit recognition, DBNs have achieved approximate accuracy rates of 98.8%. In an effort to optimize the data representation achieved by the DBN and maximize their descriptive power, re…
Noisy PN learning is the problem of binary classification when training examples may be mislabeled (flipped) uniformly with noise rate rho1 for positive examples and rho0 for negative examples. We propose Rank Pruning (RP) to solve noisy PN learning and the open problem of estimating the noise rates, i.e. the fraction …
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.
New method uses random discriminators to train GANs more efficiently.
problem Difficulty in training Generative Adversarial Networks (GANs).
method Proposes a new generative network using random discriminators.
result The method leads to a more stable and efficient optimization problem.
Mobile agents classify images via reinforcement learning and consensus.
problem Image classification using multiple mobile agents.
method Proposed network architecture for local belief formation and feature extraction. Decentralized consensus protocol using reinforcement learning.
result Effectiveness of the proposed framework demonstrated on MNIST dataset.
This paper compares two GAN architectures to reduce mode collapse.
problem Reducing mode collapse in Generative Adversarial Networks (GANs).
method Explains and compares PacGAN and VEEGAN models.
result PacGAN performs slightly better than vanilla GAN in terms of mode collapse.
In this paper, we propose a Tensor Train Neighborhood Preserving Embedding (TTNPE) to embed multi-dimensional tensor data into low dimensional tensor subspace. Novel approaches to solve the optimization problem in TTNPE are proposed. For this embedding, we evaluate novel trade-off gain among classification, computation…
DRNets combine deep learning and reasoning for complex tasks.
problem Solving complex tasks, especially in scientific discovery, with limited supervision.
method DRNets integrate logic and neural network optimization to encode structured latent spaces constrained by prior knowledge.
result DRNets outperform state-of-the-art models in scientific discovery tasks, recovering more precise crystal structures.
Gravilon improves gradient descent for neural networks.
problem Improving efficiency and accuracy of gradient descent methods.
method Uses geometric modification of gradient step lengths.
result Promising experimental results on MNIST classification.
A new neural network uses stigmergy to incorporate time.
problem Designing neural networks that can handle temporal data.
method Employing computational stigmergy to dynamically adjust neuron activation levels.
result Solved the XOR problem with a single stigmergic neuron.
Deep Generative Model with Beta Bernoulli Process for Modeling and Learning Confounding Factorscs.LG
Paper tackles deep learning confounding factors, learns unseen factors.
problem Learning from data with unknown and potentially infinite confounding factors.
method Combines deep generative models with Bayesian non-parametric factor models (Indian Buffet Process).
result Model can learn from data with unknown and potentially infinite confounding factors.
Bayesian approach uses generative models as priors for better source separation.
problem Artifacts in source separation for richly structured data.
method Bayesian approach with generative models as priors and noise-annealed Langevin dynamics.
result Achieves state-of-the-art performance for MNIST digit separation.
Shallow networks with local learning rules can match deep learning performance.
problem Training deep neural networks is biologically implausible; the goal is to achieve similar performance with shallow networks.
method Investigated shallow networks with one hidden layer and a single readout layer, using various local learning rules for the hidden layer and supervised learning for the readout layer.
result Shallow networks can achieve test accuracy comparable to deep learning models, suggesting the use of different datasets for testing.
Generative Adversarial Nets [8] were recently introduced as a novel way to train generative models. In this work we introduce the conditional version of generative adversarial nets, which can be constructed by simply feeding the data, y, we wish to condition on to both the generator and discriminator. We show that this…
Tent adapts models during testing by minimizing entropy of predictions.
problem Adapting models to new data during testing with limited information.
method Test entropy minimization (tent) and online channel-wise affine transformations.
result Reduces generalization error on various datasets and benchmarks.
Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified and a novel rearrangement algorithm is proposed, which we show is strictly decreas…
We introduce a simple permutation equivariant layer for deep learning with set structure.This type of layer, obtained by parameter-sharing, has a simple implementation and linear-time complexity in the size of each set. We use deep permutation-invariant networks to perform point-could classification and MNIST-digit sum…
Data-Adaptive Discriminative Feature Localization with Statistically Guaranteed Interpretationstat.ML
Develops a method to interpret deep learning models by identifying key features.
problem Revealing the decision-making process of blackbox models from raw data to predictions.
method Adversarial attacks to localize discriminative features with statistical guarantees.
result Locally identified features are both biologically plausible and statistically significant.
Supervised Domain Adaptation: A Graph Embedding Perspective and a Rectified Experimental Protocolcs.LG
This paper improves domain adaptation methods using graph embedding.
problem Alleviating distribution gaps between different data domains.
method Formulate domain adaptation as graph embedding, analyze loss functions, propose rectified evaluation protocol.
result Improved benchmarks on standard datasets demonstrate the effectiveness of the proposed methods.
This paper studies the performance of a recently proposed preconditioned stochastic gradient descent (PSGD) algorithm on recurrent neural network (RNN) training. PSGD adaptively estimates a preconditioner to accelerate gradient descent, and is designed to be simple, general and easy to use, as stochastic gradient desce…
Neural machine learning methods, such as deep neural networks (DNN), have achieved remarkable success in a number of complex data processing tasks. These methods have arguably had their strongest impact on tasks such as image and audio processing - data processing domains in which humans have long held clear advantages…
Low-rank combinatorial optimization and statistical learning by spatial photonic Ising machinecond-mat.dis-nn
New model enhances SPIM for solving low-rank combinatorial optimization and statistical learning problems.
problem Solving large-scale combinatorial optimization problems efficiently.
method Proposed a new computing model for SPIM that can handle low-rank interaction matrices.
result Demonstrated efficient learning, classification, and sampling of MNIST images using the model.
This paper defines a new learning architecture, Layered Self-Organizing Maps (LSOMs), that uses the SOM and supervised-SOM learning algorithms. The architecture is validated with the MNIST database of hand-written digit images. LSOMs are similar to convolutional neural nets (covnets) in the way they sample data, but di…
KL-LIME explains Bayesian models by projecting them locally to simpler models.
problem Explaining predictions of complex Bayesian models.
method Combines LIME with Bayesian projection methods.
result Demonstrates improved explanation of MNIST classifications.
Extracting automatically the complex set of features composing real high-dimensional data is crucial for achieving high performance in machine--learning tasks. Restricted Boltzmann Machines (RBM) are empirically known to be efficient for this purpose, and to be able to generate distributed and graded representations of…
Proposes a method to update model weights by dynamically changing features during training.
problem Updating model weights efficiently during training.
method Dynamic feature replacement during training to update model weights.
result Increased model accuracy with same training time and complexity.
MIWAE fills missing data in images with deep learning.
problem Handling missing data in incomplete datasets.
method MIWAE uses importance-weighted autoencoder to train DLVMs on incomplete data sets.
result MIWAE provides accurate single imputations and competitive performance with state-of-the-art methods.
The ability to learn tasks in a sequential fashion is crucial to the development of artificial intelligence. Neural networks are not, in general, capable of this and it has been widely thought that catastrophic forgetting is an inevitable feature of connectionist models. We show that it is possible to overcome this lim…
The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlinear feature space into a low dim…
Approximate Message Passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problem. The AMP framework provides modularity in the choice of signal prior; here we propose a hierarchical form of the Gauss-Bernouilli prior which utilizes a Restricted Boltzmann Machin…