Logistic-Gated Operators Enable Auditable Unit-Aware Thresholds in Symbolic Regression

• URL: http://arxiv.org/abs/2510.05178v2
• Date: Sun, 12 Oct 2025 14:10:02 GMT
• Title: Logistic-Gated Operators Enable Auditable Unit-Aware Thresholds in Symbolic Regression
• Abstract summary: logistic-gated operators (LGO) are differentiable gates with learnable location and steepness.<n>On predominantly smooth tasks, gates are pruned, preserving parsimony.<n>The result is compact symbolic equations with explicit, unit-aware thresholds that can be audited against clinical anchors.
• Score: 3.2657452368624678
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Symbolic regression promises readable equations but struggles to encode unit-aware thresholds and conditional logic. We propose logistic-gated operators (LGO) -- differentiable gates with learnable location and steepness -- embedded as typed primitives and mapped back to physical units for audit. Across two primary health datasets (ICU, NHANES), the hard-gate variant recovers clinically plausible cut-points: 71% (5/7) of assessed thresholds fall within 10% of guideline anchors and 100% within 20%, while using far fewer gates than the soft variant (ICU median 4.0 vs 10.0; NHANES 5.0 vs 12.5), and remaining within the competitive accuracy envelope of strong SR baselines. On predominantly smooth tasks, gates are pruned, preserving parsimony. The result is compact symbolic equations with explicit, unit-aware thresholds that can be audited against clinical anchors -- turning interpretability from a post-hoc explanation into a modeling constraint and equipping symbolic regression with a practical calculus for regime switching and governance-ready deployment.

Related papers

• The Magnitude Mirage: Rethinking Confidence for Reasoning-Intensive Retrieval [22.82938587928396]
  Many production RAG systems implement retrieval abstention by thresholding raw similarity scores, implicitly treating score magnitude as a confidence signal.<n>We demonstrate that this practice degrades systematically as queries require reasoning beyond semantic matching.<n>To address this without computationally expensive alternatives, we conduct a large-scale empirical study of six zero-cost Query Performance Prediction (QPP) metrics across three cognitive tiers.
  arXiv  Detail & Related papers  (2026-09-14T13:49:24Z)
• Relational Over-Regularization: Graph-Based AI-Generated Text Detection via Sentence Transition Deviation [4.4331439696271415]
  CrossSource Stylometric Fingerprint (CSFG) is a graph-based framework that encodes positional, sequential, semantic and transition deviation signals as learnable GNN edge features.<n>CSFG achieves 97.14% accuracy under binary detection, outperforming the strongest graph-based baseline by 11.14 pp.
  arXiv  Detail & Related papers  (2026-08-27T06:51:40Z)
• AttackPathGNN: Cross-function vulnerability detection in smart contracts using state interference graphs and conjunction pooling [3.8615905456206256]
  Existing learning-based detectors for Solidity smart-contracts reduce vulnerability detection to pattern matching within single functions.<n>We propose AttackPathGNN, a graph neural network (GNN) that reframes detection as reasoning over explicit attack paths.
  arXiv  Detail & Related papers  (2026-06-04T10:30:24Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• RVPO: Risk-Sensitive Alignment via Variance Regularization [13.192921543523283]
  We propose Reward-Variance Policy Optimization (RVPO), a risk-sensitive framework that penalizes inter-reward variance during advantage aggregation.<n>We show via Taylor expansion that a LogSumExp (SoftMin) operator effectively acts as a smooth variance penalty.<n>By preventing the model from neglecting difficult constraints to exploit easier objectives, RVPO improves overall scores on HealthBench.
  arXiv  Detail & Related papers  (2026-05-07T06:43:05Z)
• GoAT-X: A Graph of Auditing Thoughts for Securing Token Transactions in Cross-Chain Contracts [52.51342355102833]
  Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers.<n>Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions.<n>We propose GoAT-X, a framework that shifts automated cross-chain smart contracts auditing from pattern matching toward systematic first-principles verification.
  arXiv  Detail & Related papers  (2026-04-27T11:34:21Z)
• REAL: Regression-Aware Reinforcement Learning for LLM-as-a-Judge [83.2858110368572]
  We propose textbfREAL (underlineREgression-underlineAware Reinforcement underlineLThought), a principled RL framework designed to optimize regression rewards.<n>We show that REAL consistently outperforms both regression-aware SFT baselines and standard RL methods.
  arXiv  Detail & Related papers  (2026-03-17T21:19:08Z)
• In-Context Symbolic Regression for Robustness-Improved Kolmogorov-Arnold Networks [3.7163623763519733]
  Symbolic regression aims to replace blackbox predictors with analytical expressions that can be inspected and validated in machine learning.<n> Kolmogorov-Arnold Pursuit Networks (KANs) are well suited to this goal because each connection between adjacent units (an "edge") ismetd by a univariate function.<n>In practice, however, symbolic extraction is a bottleneck: the standard KAN-to-symbol approach fits operators to each learned edge function in fine isolation.
  arXiv  Detail & Related papers  (2026-03-16T13:21:26Z)
• Polynomial Surrogate Training for Differentiable Ternary Logic Gate Networks [3.2249474972573555]
  We introduce Polynomial Surrogate Training (PST), which represents each ternary neuron as a degree-$ (2,2)$ with 9 learnable coefficients.<n>PST trains $2$-$3times$ faster than binary DLGNs and discover true ternary gates that are functionally diverse.
  arXiv  Detail & Related papers  (2026-02-27T20:37:17Z)
• CORE: Context-Robust Remasking for Diffusion Language Models [51.59514489363897]
  We propose Context-Robust Remasking (CORE), a training-free framework for inference-time revision.<n>Rather than trusting static token probabilities, CORE identifies context-brittle tokens by probing their sensitivity to targeted masked-context perturbations.<n>On LLaDA-8B-Base, CORE delivers consistent improvements across reasoning and code benchmarks, outperforming compute-matched baselines and improving MBPP by up to 9.2 percentage points.
  arXiv  Detail & Related papers  (2026-02-04T00:12:30Z)
• Explainability Methods for Hardware Trojan Detection: A Systematic Comparison [0.0]
  This work compares three explainability categories for gate-level detection on the Trust-Hub benchmark.<n>Property-based analysis provides explanations through circuit concepts like "high fanin complexity near outputs indicates potential triggers"<n>Case-based reasoning achieves 97.4% correspondence between predictions and training trojans, offering justifications grounded in precedent.
  arXiv  Detail & Related papers  (2026-01-26T17:13:00Z)
• Scaling the Scaling Logic: Agentic Meta-Synthesis of Logic Reasoning [18.75349680577575]
  SSLogic is a framework for continuous family evolution with controllable difficulty.<n>Training on SSLogic-evolved data yields consistent gains over the seed baseline at matched steps.
  arXiv  Detail & Related papers  (2026-01-23T13:26:01Z)
• How Does Prefix Matter in Reasoning Model Tuning? [57.69882799751655]
  We fine-tune three R1 series models across three core model capabilities: reasoning (mathematics), coding, safety, and factuality.<n>Results show that prefix-conditioned SFT improves both safety and reasoning performance, yielding up to +6% higher Safe@1 accuracy.
  arXiv  Detail & Related papers  (2026-01-04T18:04:23Z)
• SCI: An Equilibrium for Signal Intelligence [0.0]
  We present SCI, a control-theoretic framework that models interpretability as a regulated state.<n> SCI formalizes the interpretive error Delta SP and actively drives SP(t) in [0, 1] toward a target via a projected update on the parameters Theta under a human-gain budget.
  arXiv  Detail & Related papers  (2025-11-15T14:48:17Z)
• Efficient Thought Space Exploration through Strategic Intervention [54.35208611253168]
  We propose a novel Hint-Practice Reasoning (HPR) framework that operationalizes this insight through two synergistic components.<n>The framework's core innovation lies in Distributional Inconsistency Reduction (DIR), which dynamically identifies intervention points.<n> Experiments across arithmetic and commonsense reasoning benchmarks demonstrate HPR's state-of-the-art efficiency-accuracy tradeoffs.
  arXiv  Detail & Related papers  (2025-11-13T07:26:01Z)
• What Layers When: Learning to Skip Compute in LLMs with Residual Gates [66.23658560048241]
  GateSkip is a residual-stream gating mechanism that enables token-wise layer skipping in decoder-only LMs.<n>Each Attention/MLP branch is equipped with a sigmoid-linear gate that condenses the branch's output before it re-enters the residual stream.
  arXiv  Detail & Related papers  (2025-10-13T16:31:50Z)
• DiSC-AMC: Token- and Parameter-Efficient Discretized Statistics In-Context Automatic Modulation Classification [19.190236060870184]
  Large Language Models (LLMs) can perform Automatic Modulation Classification (AMC) in an open-set manner without fine-tuning.<n>We present Discretized Statistics in-Context Automatic Modulation Classification (DiSC-AMC)<n>DiSC-AMC is a token- and parameter-efficient variant that discretizes higher-order statistics and cumulants into compact symbolic tokens.
  arXiv  Detail & Related papers  (2025-09-30T22:20:57Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• Inducing Faithfulness in Structured Reasoning via Counterfactual Sensitivity [6.908972852063454]
  Large language models often generate a correct answer while relying on a flawed or irrelevant reasoning trace.<n>This paper introduces textbfCounterfactual Sensitivity Regularization (CSR), a novel training objective.<n>CSR improves faithfulness over standard fine-tuning and process supervision by up to 70 percentage points.
  arXiv  Detail & Related papers  (2025-09-01T15:18:46Z)
• NDCG-Consistent Softmax Approximation with Accelerated Convergence [67.10365329542365]
  We propose novel loss formulations that align directly with ranking metrics.<n>We integrate the proposed RG losses with the highly efficient Alternating Least Squares (ALS) optimization method.<n> Empirical evaluations on real-world datasets demonstrate that our approach achieves comparable or superior ranking performance.
  arXiv  Detail & Related papers  (2025-06-11T06:59:17Z)
• SEAL: Steerable Reasoning Calibration of Large Language Models for Free [58.190800043449336]
  Large Language Models (LLMs) have demonstrated compelling capabilities for complex reasoning tasks via the extended chain-of-thought (CoT) reasoning mechanism.<n>Recent studies reveal substantial redundancy in the CoT reasoning traces, which negatively impacts model performance.<n>We introduce SEAL, a training-free approach that seamlessly calibrates the CoT process, improving accuracy while demonstrating significant efficiency gains.
  arXiv  Detail & Related papers  (2025-04-07T02:42:07Z)
• (G)I-DLE: Generative Inference via Distribution-preserving Logit Exclusion with KL Divergence Minimization for Constrained Decoding [0.0]
  (G)I-DLE is a new approach to constrained decoding that leverages KL divergence to preserve the intrinsic conditional probability distribution of autoregressive language models.<n>We validate our method on the K2-Eval dataset, specifically designed to assess Korean language fluency.
  arXiv  Detail & Related papers  (2025-03-23T12:37:14Z)
• Lazy Layers to Make Fine-Tuned Diffusion Models More Traceable [70.77600345240867]
  A novel arbitrary-in-arbitrary-out (AIAO) strategy makes watermarks resilient to fine-tuning-based removal. Unlike the existing methods of designing a backdoor for the input/output space of diffusion models, in our method, we propose to embed the backdoor into the feature space of sampled subpaths. Our empirical studies on the MS-COCO, AFHQ, LSUN, CUB-200, and DreamBooth datasets confirm the robustness of AIAO.
  arXiv  Detail & Related papers  (2024-05-01T12:03:39Z)
• Learning Label Encodings for Deep Regression [10.02230163797581]
  Deep regression networks are widely used to tackle the problem of predicting a continuous value for a given input. The space of label encodings for regression is large. This paper introduces Regularized Label Learning (RLEL) for end-to-end training of an entire network and its label encoding.
  arXiv  Detail & Related papers  (2023-03-04T00:11:34Z)
• Label Encoding for Regression Networks [9.386028796990399]
  We introduce binary-encoded labels (BEL), which generalizes the application of binary classification to regression. BEL achieves state-of-the-art accuracies for several regression benchmarks.
  arXiv  Detail & Related papers  (2022-12-04T21:23:36Z)
• Intermediate Loss Regularization for CTC-based Speech Recognition [58.33721897180646]
  We present a simple and efficient auxiliary loss function for automatic speech recognition (ASR) based on the connectionist temporal classification ( CTC) objective. We evaluate the proposed method on various corpora, reaching word error rate (WER) 9.9% on the WSJ corpus and character error rate (CER) 5.2% on the AISHELL-1 corpus respectively.
  arXiv  Detail & Related papers  (2021-02-05T15:01:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.