BuckiNet: ML Discovery & PLC Sensing

• BuckiNet is a dual system comprising a neural network that embeds the Buckingham Pi theorem for discovering dimensionless groups and a power-line sensor protocol for robust data collection.
• The neural architecture leverages a dedicated Pi-layer to extract sparse, interpretable dimensionless groups, achieving high regression accuracy on canonical physics problems.
• The power-line protocol employs a bucket-brigade design to enable deterministic, energy-efficient sensing with low latency in harsh and distributed environments.

BuckiNet is a term referring to two technically rigorous, application-specific systems: (1) a neural network architecture designed for automated discovery of dimensionless groups in physics-informed machine learning (Bakarji et al., 2022), and (2) a power‐line–based sensor network protocol for linear, queue-style deployment in harsh environments (Santos, 2021). Despite nominal similarity, the two are unrelated; both are documented extensively in the academic literature and deployed or validated in distinct domains. This article details each system comprehensively, focusing primarily on the neural-network-based BuckiNet as introduced in "Dimensionally Consistent Learning with Buckingham Pi", before summarizing key features of the power line protocol.

1. Dimensionally Consistent BuckiNet: Neural Architecture

BuckiNet, as specified in (Bakarji et al., 2022), is a deep learning architecture embedding dimensional analysis principles for regression or model discovery in applications lacking governing equations but exhibiting dimensional symmetries. Its core is the explicit incorporation of the Buckingham Pi theorem in the network’s first ("Pi") layer, enabling the automated extraction of $n’ = n - \mathrm{rank}(D_p)$ dimensionless groups ($\pi_p$) from physical input variables $p \in \mathbb{R}^n$.

Architectural Flow

• Input Preprocessing: Data matrices $P \in \mathbb{R}^{m \times n}$ and $Q \in \mathbb{R}^{m \times k}$ are constructed.
• Pi-Layer (First Layer): For each input row $x$ (strictly positive to allow logarithms), a linear mapping $z = \log x$ is followed by $u = zW$, where $W \in \mathbb{R}^{n \times n’}$ is trained. The monomial mapping yields $\pi_p = \exp(u) = \exp(\log p\,W)$, a direct realization of monomial Pi-groups with exponents encoded in $\pi_p$0.
• ψ-Network (Subsequent Layers): The dimensionless groups $\pi_p$1 are passed into a standard feedforward MLP with $\pi_p$2 ELU-activated hidden layers, learning a nonlinear regression $\pi_p$3.
• Buckingham Pi Enforcement: A soft null-space penalty ensures each column $\pi_p$4 approximately resides in $\pi_p$5, enforcing near-dimensional consistency.
• Output: The network output $\pi_p$6 is compared to known or computed dimensionless outputs $\pi_p$7.

2. Loss Function and Learning Objective

The BuckiNet loss aggregates three terms:

$\pi_p$8

where $\pi_p$9 includes both the first-layer $p \in \mathbb{R}^n$0 and MLP parameters.

• Data Fit: $p \in \mathbb{R}^n$1 (MSE in output space).
• Soft Null-Space Penalty: $p \in \mathbb{R}^n$2, promoting $p \in \mathbb{R}^n$3 columns close to the null-space.
• Regularization: $p \in \mathbb{R}^n$4, enforcing sparse and small exponents.

Hyperparameters $p \in \mathbb{R}^n$5, $p \in \mathbb{R}^n$6, $p \in \mathbb{R}^n$7 are selected based on validation performance and desired regularity.

3. Training Algorithm and Implementation

The BuckiNet model is trained as follows:

• Initialization: $p \in \mathbb{R}^n$8 is randomly initialized (e.g., Glorot) or using eigenvectors of $p \in \mathbb{R}^n$9 with minimum singular values; MLP weights via Xavier/Glorot.
• Optimization: Adam or RMSProp with learning rates in $P \in \mathbb{R}^{m \times n}$0, using either full-batch or mini-batch gradient descent dictated by $P \in \mathbb{R}^{m \times n}$1.
• Hyperparameter Selection: $P \in \mathbb{R}^{m \times n}$2, $P \in \mathbb{R}^{m \times n}$3 (for $P \in \mathbb{R}^{m \times n}$4), $P \in \mathbb{R}^{m \times n}$5, $P \in \mathbb{R}^{m \times n}$6 chosen to ensure interpretable, dimensionally-consistent $P \in \mathbb{R}^{m \times n}$7.
• Stopping Criteria: Validation MSE plateaus and null-space penalty meets threshold.
• Post-Processing: $P \in \mathbb{R}^{m \times n}$8 columns can be rounded to rational values, and each discovered Pi-group rescaled for interpretability.

4. Empirical Examples and Applications

BuckiNet demonstrates robust performance across several canonical problems:

• Harmonic Oscillator (Pendulum): Inputs $P \in \mathbb{R}^{m \times n}$9; output $Q \in \mathbb{R}^{m \times k}$0 (dimensionless). BuckiNet with $Q \in \mathbb{R}^{m \times k}$1 discovers $Q \in \mathbb{R}^{m \times k}$2; fits the angular response with MSE $Q \in \mathbb{R}^{m \times k}$3.
• Bead on Rotating Hoop: Inputs $Q \in \mathbb{R}^{m \times k}$4; outputs are top principal components of $Q \in \mathbb{R}^{m \times k}$5. BuckiNet ($Q \in \mathbb{R}^{m \times k}$6) finds Pi-groups matching classical analysis $Q \in \mathbb{R}^{m \times k}$7, $Q \in \mathbb{R}^{m \times k}$8 within 2% in each exponent; achieves PCA-coefficient MSE $Q \in \mathbb{R}^{m \times k}$9, outperforming baseline MLP by $x$0.
• These results validate BuckiNet’s utility in discovering physically meaningful, sparse, and interpretable dimensional reductions from purely data-driven inference.

5. Strengths, Limitations, and Extension Directions

Strengths

• Automates the identification of interpretable, sparse, dimensionless groups.
• Embeds physical symmetries directly, yielding improved generalization and smaller networks via dimensionality reduction.
• Integrates naturally with modern deep learning frameworks (TensorFlow, PyTorch).

Limitations

• Requires strictly positive input data due to logarithmic layer, necessitating data shifts if negatives are present.
• Null-space penalty is inherently soft, meaning careful tuning of $x$1 may be required for precise integer/rational exponents.
• Sensitivity to hyperparameters and possible local minima due to the entanglement of multiple Pi-groups.

Potential Extensions

• Implementing hard null-space constraints to enforce $x$2 exactly.
• Mixed-integer optimization for integer/rational exponents in $x$3.
• Automatic determination of $x$4, especially when $x$5.
• Generalizations to temporal/spatial input fields using convolutional Pi-layers.

6. Power-Line–Based BuckiNet Protocol for Sensed Quantity Acquisition

Independently, the BuckiNet protocol (Santos, 2021) denotes a deterministic, energy-efficient, and scalable network design for linear sensor chains, primarily deployed for profile acquisition (e.g., pressure or temperature) in challenging field conditions such as oil wells.

System Architecture and Protocol Details

• Topology: Linearly arranged $x$6 nodes over power-line infrastructure with one-end coordinator.
• PHY Layer: Utilizes $x$7-QAM OFDM modulation over $x$8 MHz PLC spectrum with concatenated FEC; fixed-length OFDM “bucket” bursts (~0.333 ms).
• MAC Layer: Contentionless, cyclical measurement relay (“bucket-brigade”), removing the need for token rings; asynchronous CSMA/CA for management.
• Timing: End-to-end latency for $x$9 nodes is $z = \log x$0 s per cycle, supporting kilometer-scale infrastructure.
• Energy and Reliability: Each transmit at $z = \log x$1 dBm requires $z = \log x$2J per bucket; triple-payload error correction and neighbor-fallback self-healing achieve packet-error rates $z = \log x$3.
• Applications: Demonstrated for oil/gas well monitoring, power-line tower integrity, underground cable surveillance, and various large-scale environmental sensing.

Comparative Table

Domain	BuckiNet (NN)	BuckiNet (PLC Network)
Application	ML for Physics	Sensor Data Collection
Core Task	Pi-group Discovery	End-to-End Profile Relay
Discipline	Deep Learning, Physics	Communications, Sensing
arXiv Reference	(Bakarji et al., 2022)	(Santos, 2021)

7. Summary and Outlook

BuckiNet, in both its neural and network incarnations, exemplifies rigorous embedding of domain structure (dimensional or topological) within data-driven and communication frameworks. In machine learning, BuckiNet has demonstrated superior performance and interpretability where traditional regression fails to impose symmetry constraints. In embedded sensing, its power-line–driven bucket-brigade approach solutions deterministic, robust collection of distributed spatial profiles. Open questions in the neural domain include the development of strict constraints and extension to field data, while network deployments demand continued validation at ever-larger spatial scales and under harsher noise regimes.

References:

• BuckiNet (Dimensionally Consistent DL): (Bakarji et al., 2022)
• BuckiNet (Sensor Network Protocol): (Santos, 2021)