Cited in
(only showing first 100 items - show all)- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- Multidimensional scaling of noisy high dimensional data
- Variance-based single-call proximal extragradient algorithms for stochastic mixed variational inequalities
- 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
- PLS for Big Data: a unified parallel algorithm for regularised group PLS
- Supervised learning of sheared distributions using linearized optimal transport
- Least \(k\)th-order and Rényi generative adversarial networks
- Sparse projection oblique randomer forests
- scientific article; zbMATH DE number 7370534 (Why is no real title available?)
- Alignment based kernel learning with a continuous set of base kernels
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Confident learning: estimating uncertainty in dataset labels
- Tropical coordinates on the space of persistence barcodes
- Probably correct \(k\)-nearest neighbor search in high dimensions
- Arbitrary conditional inference in variational autoencoders via fast prior network training
- An adaptive Polyak heavy-ball method
- On the perceptron's compression
- On large batch training and sharp minima: a Fokker-Planck perspective
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
- DiffRNN: differential verification of recurrent neural networks
- \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks
- Ada-boundary: accelerating DNN training via adaptive boundary batch selection
- Fast greedy \(\mathcal{C} \)-bound minimization with guarantees
- Robustness verification of quantum classifiers
- Robustness verification of semantic segmentation neural networks using relaxed reachability
- Reachable sets of classifiers and regression models: (non-)robustness analysis and robust training
- scientific article; zbMATH DE number 7008335 (Why is no real title available?)
- A weighted framework for unsupervised ensemble learning based on internal quality measures
- Drop-activation: implicit parameter reduction and harmonious regularization
- DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization
- The loss surfaces of neural networks with general activation functions
- A model of semantic completion in generative episodic memory
- Power spectral clustering
- Fast density-weighted low-rank approximation spectral clustering
- Bayesian inference for spatio-temporal spike-and-slab priors
- Sparse representation on graphs by tight wavelet frames and applications
- An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
- Efficient and sparse neural networks by pruning weights in a multiobjective learning approach
- A random matrix analysis of random Fourier features: beyond the Gaussian kernel, a precise phase transition, and the corresponding double descent*
- Deep learning model selection of suboptimal complexity
- Computer vision. Algorithms and applications
- Enhanced ensemble-based classifier with boosting for pattern recognition
- An improvement of the parameterized frequent directions algorithm
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Use of static surrogates in hyperparameter optimization
- Multilevel Artificial Neural Network Training for Spatially Correlated Learning
- Hierarchical neural networks for image interpretation.
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- A noise-based stabilizer for convolutional neural networks
- Learning a multi-dimensional companding function for lossy source coding
- A unifying framework of synaptic and intrinsic plasticity in neural populations
- Non-local discrete \(\infty \)-Poisson and Hamilton Jacobi equations. From stochastic game to generalized distances on images, meshes, and point clouds
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Using the one-versus-rest strategy with samples balancing to improve pairwise coupling classification
- Multiscale adaptive representation of signals. I: The basic framework
- Tensors in computations
- Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks
- Computing Wasserstein barycenters via linear programming
- Second-order stochastic optimization for machine learning in linear time
- Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
- An adaptive image Euclidean distance
- Universal halting times in optimization and machine learning
- High-dimensional dynamics of generalization error in neural networks
- Sequential changepoint detection in neural networks with checkpoints
- Uncertainty quantification in graph-based classification of high dimensional data
- Scale-covariant and scale-invariant Gaussian derivative networks
- Regularization via mass transportation
- Fast and Robust Learning by Reinforcement Signals: Explorations in the Insect Brain
- Analysis of the generalization error: empirical risk minimization over deep artificial neural networks overcomes the curse of dimensionality in the numerical approximation of Black-Scholes partial differential equations
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
- Shape representation by a network of V4-like cells
- Hypocoercivity properties of adaptive Langevin dynamics
- Acceleration of hierarchical Bayesian network based cortical models on multicore architectures
- Interaction identification and clique screening for classification with ultra-high dimensional discrete features
- Explaining black-box classifiers using \textit{post-hoc} explanations-by-example: the effect of explanations and error-rates in XAI user studies
- Nonlinear dimensionality reduction using a temporal coherence principle
- Semi-supervised learning with nuclear norm regularization
- Brain-inspired constructive learning algorithms with evolutionally additive nonlinear neurons
- Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
- Dissociable forms of repetition priming: a computational model
- Turnpike in optimal control of PDEs, ResNets, and beyond
- Clustering with prim's sequential representation of minimum spanning tree
- Maximum principle based algorithms for deep learning
- Neural network approximations for Calabi-Yau metrics
- Simplified energy landscape for modularity using total variation
- Tensor decomposition for learning Gaussian mixtures from moments
- A mean field games model for finite mixtures of Bernoulli and categorical distributions
- Probabilistic interpretation of the distillation problem
- 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
- scientific article; zbMATH DE number 6276262 (Why is no real title available?)
- Robustness verification of ReLU networks via quadratic programming
- On Kernel Method–Based Connectionist Models and Supervised Deep Learning Without Backpropagation
- Kernel spectral clustering of large dimensional data
This page was built for software: MNIST
