Tootfinder

{\L}ukasiewicz Logic with Actions for Neural Networks training
Ioana Leu\c{s}tean (University of Bucharest), Bogdan Macovei (University of Bucharest)
https://arxiv.org/abs/2509.13020

Łukasiewicz Logic with Actions for Neural Networks training
Based on the already known connection between multilayer perceptrons and Lukasiewicz logic with rational coefficients, we take a step forward in analyzing its training process using a three-sorted hybrid modal logic: a multilayer perceptron is a logical formula; the actions of the training process are modal operators; the training process is a sequence of logical deductions. Using the proof assistant and the programming language Lean 4, the algorithmic implementation of the training process is …

An Experimental Exploration of In-Memory Computing for Multi-Layer Perceptrons
Pedro Carrinho, Hamid Moghadaspour, Oscar Ferraz, Jo\~ao Dinis Ferreira, Yann Falevoz, Vitor Silva, Gabriel Falcao
https://arxiv.org/abs/2508.07317

An Experimental Exploration of In-Memory Computing for Multi-Layer Perceptrons
In modern computer architectures, the performance of many memory-bound workloads (e.g., machine learning, graph processing, databases) is limited by the data movement bottleneck that emerges when transferring large amounts of data between the main memory and the central processing unit (CPU). Processing-in-memory is an emerging computing paradigm that aims to alleviate this data movement bottleneck by performing computation close to or within the memory units, where data resides. One example of…

N-BEATS-MOE: N-BEATS with a Mixture-of-Experts Layer for Heterogeneous Time Series Forecasting
Ricardo Matos, Luis Roque, Vitor Cerqueira
https://arxiv.org/abs/2508.07490 https:…

N-BEATS-MOE: N-BEATS with a Mixture-of-Experts Layer for Heterogeneous Time Series Forecasting
Deep learning approaches are increasingly relevant for time series forecasting tasks. Methods such as N-BEATS, which is built on stacks of multilayer perceptrons (MLPs) blocks, have achieved state-of-the-art results on benchmark datasets and competitions. N-BEATS is also more interpretable relative to other deep learning approaches, as it decomposes forecasts into different time series components, such as trend and seasonality. In this work, we present N-BEATS-MOE, an extension of N-BEATS based…

Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT
Mihailo Stojnic
https://arxiv.org/abs/2506.19276 https…

Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT
We study classical asymmetric binary perceptron (ABP) and associated \emph{local entropy} (LE) as potential source of its algorithmic hardness. Isolation of \emph{typical} ABP solutions in SAT phase seemingly suggests a universal algorithmic hardness. Paradoxically, efficient algorithms do exist even for constraint densities $α$ fairly close but at a finite distance (\emph{computational gap}) from the capacity. In recent years, existence of rare large dense clusters and magical ability of fast…

evMLP: An Efficient Event-Driven MLP Architecture for Vision
Zhentan Zheng
https://arxiv.org/abs/2507.01927 https://arxiv.org/pdf/250…

evMLP: An Efficient Event-Driven MLP Architecture for Vision
Deep neural networks have achieved remarkable results in computer vision tasks. In the early days, Convolutional Neural Networks (CNNs) were the mainstream architecture. In recent years, Vision Transformers (ViTs) have become increasingly popular. In addition, exploring applications of multi-layer perceptrons (MLPs) has provided new perspectives for research into vision model architectures. In this paper, we present evMLP accompanied by a simple event-driven local update mechanism. The proposed…

SBS: Enhancing Parameter-Efficiency of Neural Representations for Neural Networks via Spectral Bias Suppression
Qihu Xie, Yuan Li, Yi Kang
https://arxiv.org/abs/2509.07373 https…

SBS: Enhancing Parameter-Efficiency of Neural Representations for Neural Networks via Spectral Bias Suppression
Implicit neural representations have recently been extended to represent convolutional neural network weights via neural representation for neural networks, offering promising parameter compression benefits. However, standard multi-layer perceptrons used in neural representation for neural networks exhibit a pronounced spectral bias, hampering their ability to reconstruct high-frequency details effectively. In this paper, we propose SBS, a parameter-efficient enhancement to neural representatio…

QuKAN: A Quantum Circuit Born Machine approach to Quantum Kolmogorov Arnold Networks
Yannick Werner, Akash Malemath, Mengxi Liu, Vitor Fortes Rey, Nikolaos Palaiodimopoulos, Paul Lukowicz, Maximilian Kiefer-Emmanouilidis
https://arxiv.org/abs/2506.22340

QuKAN: A Quantum Circuit Born Machine approach to Quantum Kolmogorov Arnold Networks
Kolmogorov Arnold Networks (KANs), built upon the Kolmogorov Arnold representation theorem (KAR), have demonstrated promising capabilities in expressing complex functions with fewer neurons. This is achieved by implementing learnable parameters on the edges instead of on the nodes, unlike traditional networks such as Multi-Layer Perceptrons (MLPs). However, KANs potential in quantum machine learning has not yet been well explored. In this work, we present an implementation of these KAN architec…

Physics-Informed Neural Networks with Hard Nonlinear Equality and Inequality Constraints
Ashfaq Iftakher, Rahul Golder, M. M. Faruque Hasan
https://arxiv.org/abs/2507.08124 https://arxiv.org/pdf/2507.08124 https://arxiv.org/html/2507.08124
arXiv:2507.08124v1 Announce Type: new
Abstract: Traditional physics-informed neural networks (PINNs) do not guarantee strict constraint satisfaction. This is problematic in engineering systems where minor violations of governing laws can significantly degrade the reliability and consistency of model predictions. In this work, we develop KKT-Hardnet, a PINN architecture that enforces both linear and nonlinear equality and inequality constraints up to machine precision. It leverages a projection onto the feasible region through solving Karush-Kuhn-Tucker (KKT) conditions of a distance minimization problem. Furthermore, we reformulate the nonlinear KKT conditions using log-exponential transformation to construct a general sparse system with only linear and exponential terms, thereby making the projection differentiable. We apply KKT-Hardnet on both test problems and a real-world chemical process simulation. Compared to multilayer perceptrons and PINNs, KKT-Hardnet achieves higher accuracy and strict constraint satisfaction. This approach allows the integration of domain knowledge into machine learning towards reliable hybrid modeling of complex systems.
toXiv_bot_toot

Physics-Informed Kolmogorov-Arnold Networks for multi-material elasticity problems in electronic packaging
Yanpeng Gong, Yida He, Yue Mei, Xiaoying Zhuang, Fei Qin, Timon Rabczuk
https://arxiv.org/abs/2508.16999

Physics-Informed Kolmogorov-Arnold Networks for multi-material elasticity problems in electronic packaging
This paper proposes a Physics-Informed Kolmogorov-Arnold Network (PIKAN) method for analyzing elasticity problems in electronic packaging multi-material structures. The core innovation lies in replacing Multi-Layer Perceptrons (MLPs) with Kolmogorov-Arnold Networks (KANs) within the energy-based Physics-Informed Neural Networks (PINNs) framework. The method constructs admissible displacement fields that automatically satisfy essential boundary conditions and employs various numerical integratio…

Fourier Feature Networks for High-Fidelity Prediction of Perturbed Optical Fields
Joshua R. Jandrell, Mitchell A. Cox
https://arxiv.org/abs/2508.19751 https://

Fourier Feature Networks for High-Fidelity Prediction of Perturbed Optical Fields
Modelling the effects of perturbations on optical fields often requires learning highly oscillatory complex-valued functions. Standard multi-layer perceptrons (MLPs) struggle with this task due to an inherent spectral bias, preventing them from fitting high-frequency sinusoids. To overcome this, we incorporate Fourier features - a set of predefined sinusoids dependent on the perturbation - as an additional network input. This reframes the learning problem from approximating a complex function t…

Replaced article(s) found for math.ST. https://arxiv.org/list/math.ST/new
[1/1]:
- Symmetric Perceptrons, Number Partitioning and Lattices
Neekon Vafa, Vinod Vaikuntanathan

From Atoms to Dynamics: Learning the Committor Without Collective Variables
Sergio Contreras Arredondo, Chenyu Tang, Radu A. Talmazan, Alberto Meg\'ias, Cheng Giuseppe Chen, Christophe Chipot
https://arxiv.org/abs/2507.17700

From Atoms to Dynamics: Learning the Committor Without Collective Variables
This Brief Communication introduces a graph-neural-network architecture built on geometric vector perceptrons to predict the committor function directly from atomic coordinates, bypassing the need for hand-crafted collective variables (CVs). The method offers atom-level interpretability, pinpointing the key atomic players in complex transitions without relying on prior assumptions. Applied across diverse molecular systems, the method accurately infers the committor function and highlights the i…

Scientific Machine Learning with Kolmogorov-Arnold Networks
Salah A. Faroughi, Farinaz Mostajeran, Amin Hamed Mashhadzadeh, Shirko Faroughi
https://arxiv.org/abs/2507.22959 http…

Scientific Machine Learning with Kolmogorov-Arnold Networks
The field of scientific machine learning, which originally utilized multilayer perceptrons (MLPs), is increasingly adopting Kolmogorov-Arnold Networks (KANs) for data encoding. This shift is driven by the limitations of MLPs, including poor interpretability, fixed activation functions, and difficulty capturing localized or high-frequency features. KANs address these issues with enhanced interpretability and flexibility, enabling more efficient modeling of complex nonlinear interactions and effe…

Beyond ReLU: Chebyshev-DQN for Enhanced Deep Q-Networks
Saman Yazdannik, Morteza Tayefi, Shamim Sanisales
https://arxiv.org/abs/2508.14536 https://arxiv.or…

Beyond ReLU: Chebyshev-DQN for Enhanced Deep Q-Networks
The performance of Deep Q-Networks (DQN) is critically dependent on the ability of its underlying neural network to accurately approximate the action-value function. Standard function approximators, such as multi-layer perceptrons, may struggle to efficiently represent the complex value landscapes inherent in many reinforcement learning problems. This paper introduces a novel architecture, the Chebyshev-DQN (Ch-DQN), which integrates a Chebyshev polynomial basis into the DQN framework to create…