Logical scaffolds enhance AI software quality.
problem Improving AI component quality in software.
method Logical scaffolds as a method to improve AI components.
result Logical scaffolds can improve AI beyond perception systems.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,786 papers · 148 categories
Trend · papers per month
48 results for “logical scaffolds”
Diffusion probabilistic modeling of protein backbones in 3D for the motif-scaffolding problemq-bio.BM
New method learns diverse protein scaffolds for motif design.
problem Designing long, diverse protein scaffolds for specific motifs.
method E(3)-equivariant graph neural network for diffusion modeling.
result First to guarantee conditional sampling from diffusion models.
Improved scaffold generation for protein motifs using SE(3) flow matching.
problem Lack of structural diversity in generated scaffolds for protein motifs.
method Extended FrameFlow for motif-scaffolding with motif amortization and motif guidance.
result 2.5 times more designable and unique motif-scaffolds compared to state-of-the-art.
Searching new molecules in areas like drug discovery often starts from the core structures of candidate molecules to optimize the properties of interest. The way as such has called for a strategy of designing molecules retaining a particular scaffold as a substructure. On this account, our present work proposes a scaff…
Paper analyzes Scaffold algorithm for federated learning, proving linear speed-up with stochastic gradients.
problem Understanding the impact of stochastic gradients on the Scaffold algorithm's performance.
method Proved linear speed-up in the number of clients using a Markov chain analysis of global parameters and control variates.
result Scaffold achieves linear speed-up in the number of clients up to higher-order terms in the step size, but retains a higher-order bias.
Scaffolding Setscs.LG
Scaffolding sets improve predictor correctness across subsets.
problem Ensuring predictor correctness across multiple subsets.
method Inspired by neural nets, constructing scaffolding sets to ensure correctness.
result Scaffolding sets ensure predictor correctness, not just calibration.
SCAFFOLD improves Federated Learning by reducing client-drift and speeding up convergence.
problem Federated Learning's performance is limited by client-drift in heterogeneous data.
method SCAFFOLD uses control variates to correct client-drift and improve convergence.
result SCAFFOLD requires fewer communication rounds and is not affected by data heterogeneity.
Self-taught optimizer improves code generation using language models.
problem Improving code generation using language models.
method Recursive self-improvement of a scaffolding program that generates code.
result Improved scaffolding program generates programs with significantly better performance.
New method uses diffusion models to generate proteins with specific motifs.
problem Generating proteins with specific functional substructures (motifs) using diffusion models.
method Adapting SMC-aided diffusion posterior samplers to zero-shot scaffolding tasks.
result Proposed potentials and samplers improve performance in generating proteins with desired motifs.
The -skeleton of the canonical cubulation of into unit cubes is called the {\it canonical scaffolding} . In this paper, we prove that any smooth, compact, closed, -dimensional submanifold of with trivial normal bundle can be continuously isotoped by an amb…
In this paper we study topological surfaces as gridded surfaces in the 2-dimensional scaffolding of cubic honeycombs in Euclidean and hyperbolic spaces.
Paper shows LIME and SHAP explanations can be fooled by adversarial attacks.
problem Reliability of post hoc explanation methods like LIME and SHAP.
method Adversarial attack technique to hide classifier biases.
result Popular explanation techniques can be fooled into generating biased explanations.
AlphaLogics mines market logic to generate interpretable alpha factors.
problem Complex, opaque alpha factors from factor mining overlook market logic.
method Market Logic Mining, Factor Generation and Optimization, Market Logic Generation and Optimization.
result AlphaLogics improves predictive metrics and risk-adjusted returns over baselines.
NLN learns logical reasoning from neural networks.
problem Lack of logical reasoning in deep neural networks.
method Dynamic neural architecture that builds computational graph based on logical expressions, learns logical operations as neural modules, conducts propositional logical reasoning.
result NLN significantly outperforms state-of-the-art models on collaborative filtering and personalized recommendation tasks.
Explaining neural network computation in terms of probabilistic/fuzzy logical operations has attracted much attention due to its simplicity and high interpretability. Different choices of logical operators such as AND, OR and XOR give rise to another dimension for network optimization, and in this paper, we study the o…
Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.
problem Characterize polyhedrally-complete intermediate logics.
method Developed Nerve Criterion to characterize polyhedrally-complete logics combinatorially.
result Nerve Criterion provides a necessary and sufficient condition for polyhedrally-completeness.
Boolean logic used for neural network training and inference, with convergence analysis.
problem Discrete optimization in neural networks with Boolean logic.
method Boolean logic backpropagation with convergence analysis.
result First convergence analysis for Boolean logic in neural networks.
Graph neural networks struggle with proving unsatisfiability in complex logical formulas.
problem Proving unsatisfiability in complex logical formulas.
method Investigating the limitations of graph neural networks in logical reasoning tasks.
result Graph neural networks may fail in certifying unsatisfiability in Boolean formulae.
Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.
problem Lack of cognitive reasoning in deep neural networks limits their ability to solve complex prediction tasks.
method Proposes Logic-Integrated Neural Network (LINN) that learns logical operations and conducts propositional logical reasoning.
result LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.
Combines neural networks and logic circuits for interpretable, accurate, and cost-effective learning.
problem Lack of generalizability and interpretability in neural networks and high hardware cost in logic circuits.
method Trains a neural network, then translates it to random forests, and finally to AND-Inverter logic.
result The pipeline maintains greater accuracy and minimizes logic complexity.
The purpose of this paper is to discuss how topology and geometry provide, in many instances, the connective tissue that enables logical comprehension. We illustrate this theme with many examples including Venn diagrams, knot diagrams, knot-logical diagrams and an arrow of reference that elucidates self-reference and G…
This study proposes a logic architecture for the high-speed and power efficiently training of a gradient boosting decision tree model of binary classification. We implemented the proposed logic architecture on an FPGA and compared training time and power efficiency with three general GBDT software libraries using CPU a…
Kernel for STL formulae enables machine learning in temporal logic.
problem Lack of a kernel for STL formulae.
method Define a kernel for STL formulae and embed them into a Hilbert space.
result Kernel-based machine learning algorithms can now be applied to STL formulae.
Transformers learn to predict temporal logic solutions from classical solver outputs.
problem Training neural networks on logic problem solutions for verification.
method Training a Transformer on generated training data from classical solvers, focusing on one solution per formula.
result Transformers can predict correct solutions to temporal logic problems, even to unseen benchmarks.
Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…
Knowledge graph reasoning, which aims at predicting the missing facts through reasoning with the observed facts, is critical to many applications. Such a problem has been widely explored by traditional logic rule-based approaches and recent knowledge graph embedding methods. A principled logic rule-based approach is th…
We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…
Study logical generalization in GNNs using a new benchmark.
problem Understanding how GNNs adapt to new logical tasks.
method Developed GraphLog benchmark suite for logical tasks, evaluated GNNs in supervised, pretraining, and continual learning settings.
result Logical diversity during training affects GNNs' ability to generalize.
The logic of uncertainty as a logic of experience and chance and the co~event-based Bayes' theoremq-fin.GN
The logic of uncertainty is not the logic of experience and as well as it is not the logic of chance. It is the logic of experience and chance. Experience and chance are two inseparable poles. These are two dual reflections of one essence, which is called co~event. The theory of experience and chance is the theory of c…
New algorithms improve distributed optimization under mild variance conditions.
problem Improving distributed optimization for large-scale machine learning problems.
method Revisited Federated Averaging and SCAFFOLD algorithms under a general variance condition.
result Established convergence results for smooth nonconvex objective functions under mild variance conditions.
Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns. Probabilistic logic reasoning, on the other hand, is capable to take consistent and robust decisions in complex environments. The integration of deep learn…
Effectively combining logic reasoning and probabilistic inference has been a long-standing goal of machine learning: the former has the ability to generalize with small training data, while the latter provides a principled framework for dealing with noisy data. However, existing methods for combining the best of both w…
Responds to comments on Bayesian Logic Regression algorithm, provides extensions and tutorial.
problem Improving Bayesian Logic Regression algorithm and its applications.
method Summarizes and responds to discussants' comments, provides extensions and tutorial.
result Extensions and tutorial for the Bayesian Logic Regression algorithm.
Tensor logic aims to unify AI types with scalable and transparent features.
problem Lack of a unified AI programming language with scalability and transparency.
method Introduces tensor logic, a new AI language based on tensor equations.
result Tensor logic enables key AI forms like transformers, formal reasoning, and graphical models.
Despite their great success in recent years, deep neural networks (DNN) are mainly black boxes where the results obtained by running through the network are difficult to understand and interpret. Compared to e.g. decision trees or bayesian classifiers, DNN suffer from bad interpretability where we understand by interpr…
Logical neural networks solve mazes by filling dead ends, but not all methods generalize well.
problem Understanding how logical neural networks extrapolate solutions to mazes.
method Examined recurrent and implicit neural networks trained on maze-solving tasks.
result Models fail to generalize well to diverse maze sizes, suggesting limitations in learning scalable algorithms.
We introduce neural Markov logic networks (NMLNs), a statistical relational learning system that borrows ideas from Markov logic. Like Markov logic networks (MLNs), NMLNs are an exponential-family model for modelling distributions over possible worlds, but unlike MLNs, they do not rely on explicitly specified first-ord…
In 1938, Tarski proved that a formula is not intuitionistically valid if, and only if, it has a counter-model in the Heyting algebra of open sets of some topological space. In fact, Tarski showed that any Euclidean space R^n with n >= 1 suffices, as does e.g. the Cantor space. In particular, intuitionistic logic cannot…
Intermediate logic of all convex polyhedra is axiomatized.
problem Defining and axiomatizing intermediate logic for convex polyhedra.
method Using Jankov-Fine formulas, classical polyhedral geometry, and p-morphic images to establish completeness.
result A finite axiomatisation of PL for all convex polyhedra.
Paper improves robustness certification by integrating ML and logical reasoning.
problem Limited robustness certification under perturbation radius.
method Integrates statistical ML models with logical reasoning using Markov logic networks.
result First certified robustness bound for MLN derived and experimentally validated.
Safe reinforcement learning with logical constraints for optimal policy synthesis.
problem Ensuring safety during reinforcement learning while maximizing goal satisfaction.
method Adaptive safe padding that synthesizes optimal control policies satisfying temporal logic formulas.
result The proposed method handles the trade-off between exploration and safety with theoretical guarantees.
Proposes using logical specifications for multi-objective reinforcement learning to improve agent behavior.
problem Difficulties in controlling reinforcement learning agents and the need for better generalization.
method Uses propositional logic to specify the importance of multiple objectives, encoding these specifications using a recurrent neural network.
result MORL agents parameterized by logical specifications can generalize to novel combinations of objectives and achieve comparable performance.
ENN neural network learns logical syllogisms using Euler diagrams.
problem Traditional neural networks struggle with logical reasoning, especially syllogisms.
method ENN represents logical relations as Euler diagrams, optimizing syllogism structures with a novel back-propagation algorithm.
result ENN can precisely represent and reason with all 24 syllogism structures.
Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neural networks (e.g., CNNs and RNNs) with declarative first-order logic rules. Specifically, we develop…
Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple un…
This paper presents a stochastic logic time delay reservoir design. The reservoir is analyzed using a number of metrics, such as kernel quality, generalization rank, performance on simple benchmarks, and is also compared to a deterministic design. A novel re-seeding method is introduced to reduce the adverse effects of…
Improves deep learning interpretability through logical network construction.
problem Difficulty in understanding and explaining deep neural networks, especially convolution neural networks.
method Proposes a method to construct a logical network based on fully connected layers to improve interpretability.
result Improves the interpretability of deep learning processes and models.
Paper uses subjective logic to estimate uncertainty in multi-armed bandit problems.
problem Estimating uncertainty in multi-armed bandit problems.
method Formalism of subjective logic applied to multi-armed bandits, proposing new algorithms.
result Subjective logic quantities enable useful assessment of uncertainty.