FReX: Full-Wave Rectified Exponential
- FReX is an activation function defined as e^(-|x|), uniquely characterized as the fundamental solution of a second-order operator for one-hidden-layer networks.
- The model uses convolution with FReX to achieve exact parametrization and localized learning without needing boundary corrections on the real line.
- Its analytic features—exponential decay, a cusp at zero, and even symmetry—contrast with ReLU, offering precise convergence and stability in gradient descent dynamics.
The Full-Wave Rectified Exponential (FReX) is an activation function introduced in the analysis of one-hidden-layer neural networks with fixed biases as
where it is singled out by an operator-theoretic criterion: it is the unique fundamental solution of the second-order operator on . In that setting, FReX yields exact parametrization, explicit convergence analysis for gradient descent, and a localized learning operator. A separate line of work on oscillatory-signal processing does not explicitly define or analyze FReX in this form, but uses the term to situate the family within a framework of full-wave rectified nonlinearities for fundamental-frequency enhancement. The shared motif is full-wave rectification combined with exponential structure, but the mathematical objects and target applications are distinct (Macià et al., 9 Apr 2026, Steinerberger et al., 2021).
1. Definition and operator-theoretic characterization
In the neural-network analysis, FReX is defined exactly by
Its defining structural property is distributional: equivalently and . This places FReX in the same conceptual class as ReLU, which the paper treats as a fundamental solution of the one-dimensional Laplacian. The guiding principle is that activations which are fundamental solutions of second-order differential operators yield reduced one-layer models with good representability and convergence properties.
This characterization is not merely formal. In the continuous fixed-bias model, convolution with realizes the inverse of , so the activation kernel is directly tied to the differential operator governing representability. The resulting model is therefore analyzable by PDE and operator-theoretic tools rather than only by generic approximation arguments. A notable consequence is that, unlike the corresponding ReLU model on a finite interval, the FReX model on 0 needs no boundary correction term because the activation decays at infinity and is “integrable and almost localized” (Macià et al., 9 Apr 2026).
2. Qualitative analytic properties
From the exact formula 1, several properties follow immediately. FReX is continuous on 2, even, bounded by 3, and satisfies 4. It decays exponentially as 5, and it is globally Lipschitz with Lipschitz constant 6. These features sharply distinguish it from ReLU’s unbounded linear growth while preserving a comparable singularity at the origin.
The activation is not differentiable at 7. For 8,
9
and for 0,
1
Hence the one-sided derivatives satisfy 2 and 3, so the graph has a cusp at the origin. Away from 4, the second derivative satisfies 5, while distributionally
6
equivalently 7.
Its monotonicity is also asymmetric with respect to sign: FReX is increasing on 8 and decreasing on 9. Globally it is neither convex nor concave; piecewise it is convex on each half-line, but the cusp at 0 makes the function attain an interior maximum. The paper emphasizes three qualitative features together: FReX is even, “as singular as ReLU at zero,” and exponentially decaying at infinity. The same decay that localizes the learning operator also “raises the possibility of vanishing derivatives,” which is the principal trade-off relative to ReLU in standard feedforward use (Macià et al., 9 Apr 2026).
3. Fixed-bias network model and exact parametrization
The analytical setting is a one-hidden-layer model with fixed biases, derived as a reduction of the usual two-layer architecture. For FReX on the real line, the model is written as
1
with 2. Here 3 is convolution by the activation kernel, and the operator identity 4 holds on 5 with domain 6.
This identity gives exact parametrization. For any 7, the unique weight function is
8
and then 9. In contrast with the ReLU model on 0, where the representation requires an additional affine correction 1 to compensate for boundary effects, the FReX model on 2 has no such term.
The paper also develops a discrete analogue on the uniform lattice 3. With
4
and the discrete Laplacian 5, the activation satisfies a discrete fundamental-solution identity
6
where
7
Writing 8, one obtains
9
for the discrete operator 0. Thus the continuous and discrete constructions share the same structural pattern: the activation is the inverse kernel of a second-order operator, and training can be formulated directly in terms of that inverse relation (Macià et al., 9 Apr 2026).
4. Gradient descent dynamics, convergence, and spectral bias
For the continuous FReX model on 1, full-batch gradient descent has the iteration
2
with
3
If 4 denotes convolution by 5, the prediction error obeys
6
The central convergence statement is that if 7 and 8, then 9 as 0; if in addition 1, then 2, where 3.
The Fourier-space form is explicit. Writing 4, the paper gives
5
Because 6 is strictly increasing in 7, low frequencies decay faster than high frequencies. This makes the spectral-bias mechanism transparent: after 8 iterations, the effectively learned band satisfies the same 9 scaling as in the companion ReLU analysis. The paper summarizes the analogous ReLU result as frequencies up to index 0 being resolved after 1 iterations.
A major contrast with ReLU appears in the kernel of the induced learning operator. For FReX, the integral kernel of 2 is
3
which decays rapidly off the diagonal. The paper interprets this as a “fairly localized” learning process. ReLU, by contrast, induces a broadly supported kernel on 4, which complicates both interpretation and analysis. The localized FReX kernel is presented as one reason the continuous-line model becomes especially tractable, and as a possible advantage for analyzing or stabilizing stochastic training (Macià et al., 9 Apr 2026).
5. Relation to full-wave rectification and harmonic enhancement
In the oscillatory-signal literature, the role of a nonlinear activation is different. There the objective is to create or amplify a component at the underlying fundamental angular frequency 5 so as to stabilize ridge detection and improve instantaneous frequency estimation. For a class of signals 6, a nonlinear map 7 has the fundamental enhancement property if there exists 8 such that, for all 9, the transformed signal 0 either strongly enhances the fundamental Fourier coefficient or, when the fundamental is absent or too weak, generically creates a nonzero fundamental whose contribution can be assessed through the fundamental energy ratio
1
The key mechanism is harmonic mixing. Polynomial or nonanalytic nonlinearities applied to multi-harmonic inputs generate sums and differences of the original frequencies, and the 2 of the harmonic indices can emerge as a new spectral line even when the original fundamental coefficient vanishes. This explains the practical effectiveness of 3, 4, and the paper’s adaptive activation
5
applied to the normalized signal 6. For 7, the paper proves an asymptotic lower bound under nondegenerate maxima assumptions: 8 so the first Fourier coefficient grows like 9 provided the leading term does not cancel.
Within that framework, the paper does not explicitly define or analyze FReX as 0. Instead, to situate a full-wave rectified exponential map inside the same mechanism, it considers
1
with normalized variant
2
Its power series,
3
shows that all powers are present but high-order interactions are weighted by factorially decaying coefficients. The paper therefore states that such a FReX-type map still creates 4-frequency components for generic multi-harmonic signals, yet may be weaker than 5 because the coefficients 6 decay rapidly with 7. It also notes that for a single-tone input, 8 and 9 produce only even harmonics, whereas ReLU produces a fundamental because half-wave rectification has a 00-periodic Fourier series containing odd terms (Steinerberger et al., 2021).
6. Scope, practical use, and limitations
The main theoretical results for FReX concern a one-dimensional, fixed-bias setting in which the overall map is linear in the trainable parameters. In that regime, the recommended usage pattern is clear: in one-dimensional regression contexts, adopt the convolutional representation 01 with 02, choose a sufficiently small learning rate, and exploit the fact that no boundary correction is needed on 03. The theory requires no special initialization beyond 04, and if the target lies in 05, parameter convergence to 06 follows in addition to prediction convergence.
The same analysis identifies the principal numerical caution. Because FReX decays exponentially away from the origin, its values and derivatives become exponentially small for large 07. The paper therefore notes that, in standard feedforward networks, replacing ReLU by FReX may benefit from keeping pre-activations near zero, for example through input normalization or appropriate weight scaling, so as to avoid saturation far from the origin. The localized kernel 08 suggests stability and interpretability advantages, but the possibility of vanishing derivatives is the main trade-off.
The empirical evidence reported is deliberately limited. The paper states that, in a simple standard two-layer neural network for MNIST classification, replacing ReLU by FReX yields performance “roughly comparable” to ReLU and “clearly better” than Sigmoid, but it does not elaborate architectures or hyperparameters. The scope limitations are explicit: higher-dimensional models are said to be considerably more complicated; in the continuous case only strong convergence is proved because the operator 09 is compact; and extensions to stochastic gradient descent, deeper networks, and continuum–discrete correspondence are left as future directions. A plausible implication is that FReX is best understood, at present, as a mathematically transparent activation whose strongest guarantees arise in reduced models where the fundamental-solution structure can be fully exploited (Macià et al., 9 Apr 2026).