Pith. sign in

REVIEW 3 cited by

Differentiable Neural Networks with RePU Activation: with Applications to Score Estimation and Isotonic Regression

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.00608 v3 pith:GI26RF4U submitted 2023-05-01 stat.ML cs.LG

Differentiable Neural Networks with RePU Activation: with Applications to Score Estimation and Isotonic Regression

classification stat.ML cs.LG
keywords networksrepuboundsfunctionsneuralpdirdeepderivatives
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the properties of differentiable neural networks activated by rectified power unit (RePU) functions. We show that the partial derivatives of RePU neural networks can be represented by RePUs mixed-activated networks and derive upper bounds for the complexity of the function class of derivatives of RePUs networks. We establish error bounds for simultaneously approximating $C^s$ smooth functions and their derivatives using RePU-activated deep neural networks. Furthermore, we derive improved approximation error bounds when data has an approximate low-dimensional support, demonstrating the ability of RePU networks to mitigate the curse of dimensionality. To illustrate the usefulness of our results, we consider a deep score matching estimator (DSME) and propose a penalized deep isotonic regression (PDIR) using RePU networks. We establish non-asymptotic excess risk bounds for DSME and PDIR under the assumption that the target functions belong to a class of $C^s$ smooth functions. We also show that PDIR achieves the minimax optimal convergence rate and has a robustness property in the sense it is consistent with vanishing penalty parameters even when the monotonicity assumption is not satisfied. Furthermore, if the data distribution is supported on an approximate low-dimensional manifold, we show that DSME and PDIR can mitigate the curse of dimensionality.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On Explicit Super-Expressive Approximation for Neural Networks

    cs.LG 2026-07 accept novelty 7.0

    Fixed-architecture networks of width O(D) and depth O(r) approximate Hölder functions with parameter magnitude log P = O(ε^{-2D/(r+γ)} log(1/ε)) via CRT encoding.

  2. Mitigating the Curse of Dimensionality in Uniform Convergence of Deep Neural Networks via Smooth Activations

    cs.LG 2026-06 unverdicted novelty 6.0

    Smoothly activated DNNs (feedforward and residual) achieve non-asymptotic uniform convergence rates that mitigate the curse of dimensionality by adaptively using hierarchical composition structure of the target function.

  3. Distributional Off-Policy Evaluation with Deep Quantile Process Regression

    stat.ML 2026-04 unverdicted novelty 6.0

    DQPOPE estimates the entire return distribution in off-policy evaluation via deep quantile process regression, providing statistical advantages over standard single-value methods with equivalent sample sizes.