:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kinoshita, Yuri, Toyoizumi, Taro
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2404.09821
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dataset Distillation Efficiently Encodes Low-Dimensional Representations from Gradient-Based Learning of Non-Linear Tasks
by: Kinoshita, Yuri, et al.
Published: (2026)

Cortex and subcortex play distinct roles over learning when cortical memory is limited
by: Farrell, Matthew, et al.
Published: (2026)

Residual connections provably mitigate oversmoothing in graph neural networks
by: Chen, Ziang, et al.
Published: (2025)

On the expressivity of bi-Lipschitz normalizing flows
by: Verine, Alexandre, et al.
Published: (2021)

Towards graph neural networks for provably solving convex optimization problems
by: Qian, Chendi, et al.
Published: (2025)

Principles of Lipschitz continuity in neural networks
by: Luo, Róisín
Published: (2026)

Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network
by: Kinoshita, Yuri, et al.
Published: (2023)

Efficient and provably convergent end-to-end training of deep neural networks with linear constraints
by: Yang, Zonglin, et al.
Published: (2026)

Lipschitz constant estimation for general neural network architectures using control tools
by: Pauli, Patricia, et al.
Published: (2024)

Lipschitz-bounded 1D convolutional neural networks using the Cayley transform and the controllability Gramian
by: Pauli, Patricia, et al.
Published: (2023)

Nonparametric regression using over-parameterized shallow ReLU neural networks
by: Yang, Yunfei, et al.
Published: (2023)

Shallow diffusion networks provably learn hidden low-dimensional structure
by: Boffi, Nicholas M., et al.
Published: (2024)

Unrolled denoising networks provably learn optimal Bayesian inference
by: Karan, Aayush, et al.
Published: (2024)

On bounds for norms of reparameterized ReLU artificial neural network parameters: sums of fractional powers of the Lipschitz norm control the network parameter vector
by: Jentzen, Arnulf, et al.
Published: (2022)

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
by: Sbihi, Mohammed, et al.
Published: (2024)

Fixed-budget online adaptive learning for physics-informed neural networks. Towards parameterized problem inference
by: Nguyen, Thi Nguyen Khoa, et al.
Published: (2022)

Towards provably efficient quantum algorithms for large-scale machine-learning models
by: Liu, Junyu, et al.
Published: (2023)

On provable privacy vulnerabilities of graph representations
by: Wu, Ruofan, et al.
Published: (2024)

A Lipschitz spaces view of infinitely wide shallow neural networks
by: Bartolucci, Francesca, et al.
Published: (2024)

Ensembles provably learn equivariance through data augmentation
by: Nordenfors, Oskar, et al.
Published: (2024)

Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for Kolmogorov partial differential equations with Lipschitz nonlinearities in the $L^p$-sense
by: Ackermann, Julia, et al.
Published: (2023)

Generalization error bounds for two-layer neural networks with Lipschitz loss function
by: Nguwi, Jiang Yu, et al.
Published: (2026)

Attention layers provably solve single-location regression
by: Marion, Pierre, et al.
Published: (2024)

Learning efficient and provably convergent splitting methods
by: Kreusser, L. M., et al.
Published: (2024)

Amortised and provably-robust simulation-based inference
by: Bharti, Ayush, et al.
Published: (2026)

Upper and lower bounds for the Lipschitz constant of random neural networks
by: Geuchen, Paul, et al.
Published: (2023)

An efficient Wasserstein-distance approach for reconstructing jump-diffusion processes using parameterized neural networks
by: Xia, Mingtao, et al.
Published: (2024)

First-order ANIL provably learns representations despite overparametrization
by: Yüksel, Oğuz Kaan, et al.
Published: (2023)

An unsupervised tour through the hidden pathways of deep neural networks
by: Doimo, Diego
Published: (2025)

Quantum automated learning with provable and explainable trainability
by: Ye, Qi, et al.
Published: (2025)

Linear Recursive Feature Machines provably recover low-rank matrices
by: Radhakrishnan, Adityanarayanan, et al.
Published: (2024)

TS-RSR: A provably efficient approach for batch Bayesian Optimization
by: Ren, Zhaolin, et al.
Published: (2024)

Understanding polysemanticity in neural networks through coding theory
by: Marshall, Simon C., et al.
Published: (2024)

Does provable absence of barren plateaus imply classical simulability?
by: Cerezo, M., et al.
Published: (2023)

Dynamical simulation via quantum machine learning with provable generalization
by: Gibbs, Joe, et al.
Published: (2022)

Reduced storage direct tensor ring decomposition for convolutional neural networks compression
by: Gabor, Mateusz, et al.
Published: (2024)

Resolution-free neural surrogates for geometric parameterization and mapping with spatially varying fields
by: Huang, Yanwen, et al.
Published: (2026)

Des-q: a quantum algorithm to provably speedup retraining of decision trees
by: Kumar, Niraj, et al.
Published: (2023)

Entanglement-induced provable and robust quantum learning advantages
by: Zhao, Haimeng, et al.
Published: (2024)

Protein pathways as a catalyst to directed evolution of the topology of artificial neural networks
by: Lao, Oscar, et al.
Published: (2024)