MNIST

swMATH12859MaRDI QIDQ24783FDOQ24783

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Variance-based single-call proximal extragradient algorithms for stochastic mixed variational inequalities
• Tropical coordinates on the space of persistence barcodes
• Probably correct \(k\)-nearest neighbor search in high dimensions
• Reachable sets of classifiers and regression models: (non-)robustness analysis and robust training
• Drop-activation: implicit parameter reduction and harmonious regularization
• Deep learning model selection of suboptimal complexity
• Enhanced ensemble-based classifier with boosting for pattern recognition
• An improvement of the parameterized frequent directions algorithm
• Adaptive Sampling Strategies for Stochastic Optimization
• Fast and Robust Learning by Reinforcement Signals: Explorations in the Insect Brain
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
• High-dimensional dynamics of generalization error in neural networks
• Sequential changepoint detection in neural networks with checkpoints
• Acceleration of hierarchical Bayesian network based cortical models on multicore architectures
• Title not available (Why is that?)
• Embedding sample points uncertainty measures in learning algorithms
• Title not available (Why is that?)
• Improved ArtGAN for Conditional Synthesis of Natural Image and Artwork
• Approximate kernel partial least squares
• A random matrix approach to neural networks
• On the working set selection in gradient projection-based decomposition techniques for support vector machines
• Accurately computing the log-sum-exp and softmax functions
• A convolutional recursive modified self organizing map for handwritten digits recognition
• Global binary optimization on graphs for classification of high-dimensional data
• Title not available (Why is that?)
• A hybrid objective function for robustness of artificial neural networks -- estimation of parameters in a mechanical system
• Subset selection for visualization of relevant image fractions for deep learning based semantic image segmentation
• Stimulus space complexity determines the ratio of specialist and generalist neurons during pattern recognition
• Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
• Regularized greedy column subset selection
• Online multikernel learning based on a triple-norm regularizer for semantic image classification
• Spectral clustering with local projection distance measurement
• Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
• Multilayer in-place learning networks for modeling functional layers in the laminar cortex
• Plug-and-play dual-tree algorithm runtime analysis
• Double adjacency graphs-based discriminant neighborhood embedding
• Pareto models for discriminative multiclass linear dimensionality reduction
• Discovering the impact of hidden layer parameters on non-iterative training of feed-forward neural networks
• Robust regression via error tolerance
• Accelerated parallel non-conjugate sampling for Bayesian non-parametric models
• Convergence of the graph Allen-Cahn scheme
• Minimax semi-supervised set-valued approach to multi-class classification
• Computational Science and Its Applications – ICCSA 2004
• Nonlocal PDEs on graphs: from tug-of-war games to unified interpolation on images and point clouds
• Resolution-based complexity control for Gaussian mixture models
• Compressive sensing and neural networks from a statistical learning perspective
• HyperNOMAD
• Explaining AI decisions using efficient methods for learning sparse Boolean formulae
• A Unifying Framework of Synaptic and Intrinsic Plasticity in Neural Populations
• Title not available (Why is that?)
• Periodic step-size adaptation in second-order gradient descent for single-pass on-line structured learning
• Boosted discriminant projections for nearest neighbor classification
• A probabilistic approximate logic for neuro-symbolic learning and reasoning
• Recognition of degraded characters using dynamic Bayesian networks
• Large-scale data exploration with the hierarchically growing hyperbolic SOM
• Auction dynamics: a volume constrained MBO scheme
• Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds
• Hypocoercivity Properties of Adaptive Langevin Dynamics
• Title not available (Why is that?)
• Harmonic Extension on The Point Cloud
• Mind2Mind: transfer learning for GANs
• Quick and robust feature selection: the strength of energy-efficient sparse training for autoencoders
• Learning in the machine: to share or not to share?
• Generative adversarial networks with decoder-encoder output noises
• Training of deep neural networks for the generation of dynamic movement primitives
• Vulnerability of classifiers to evolutionary generated adversarial examples
• Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter
• Adversarial noise attacks of deep learning architectures: stability analysis via sparse-modeled signals
• Title not available (Why is that?)
• The loss surfaces of neural networks with general activation functions
• IQN: An Incremental Quasi-Newton Method with Local Superlinear Convergence Rate
• A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering
• Neural Networks and Deep Learning
• Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
• Development of an algorithm for reconstruction of droplet history based on deposition pattern using computational fluid dynamics and convolutional neural network
• On recovery guarantees for one-bit compressed sensing on manifolds
• Convergence of stochastic gradient descent in deep neural network
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kernel flows: from learning kernels from data into the abyss
• Graph interpolating activation improves both natural and robust accuracies in data-efficient deep learning
• Convex programming based spectral clustering
• Scheduled Restart Momentum for Accelerated Stochastic Gradient Descent
• Title not available (Why is that?)
• Cautious active clustering
• Efficient set-valued prediction in multi-class classification
• Scaling description of generalization with number of parameters in deep learning
• Data-driven algorithm selection and tuning in optimization and signal processing
• A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
• An implicit memory-based method for supervised pattern recognition
• Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
• MODES: model-based optimization on distributed embedded systems
• Quick-means: accelerating inference for K-means by learning fast transforms
• SPEED: secure, private, and efficient deep learning
• Evaluation metrics for conditional image generation
• Consensus guided incomplete multi-view spectral clustering
• MimicGAN: robust projection onto image manifolds with corruption mimicking
• EGC: entropy-based gradient compression for distributed deep learning
• Interpretable machine learning: fundamental principles and 10 grand challenges
• Hybrid tensor decomposition in neural network compression

This page was built for software: MNIST