With this positional paper we present a representation learning view on predicate invention. The intention of this proposal is to bridge the relational and deep learning communities on the problem of predicate invention. We propose a theory reconstruction approach, a formalism that extends autoencoder approach to repre…
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “Predicate Invariance”
A novel approach to improve knowledge base completion using tensor decomposition.
problem Knowledge Base Completion (KBC) as a tensor completion problem.
method Canonical Tensor Decomposition (CP) with novel regularizers and reformulation.
result Improved KBC results using CP decomposition and ComplEx model.
ABae efficiently computes subset means with expensive predicates using stratified sampling.
problem Computing subset means with expensive predicates efficiently.
method Stratified sampling and proxy models.
result Mean squared error of when is split evenly between stages.
A new method learns graph-level features for drug properties predication.
problem Predicting drug efficacy and toxicity from molecular graphs.
method Introducing a dummy super node connected to all nodes and modifying graph operations to learn graph-level features.
result The method improves molecular properties predication performance on MoleculeNet.
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.
Paper proposes a novel RRL framework that learns from images and incorporates expert knowledge.
problem Lack of effective methods to incorporate expert background knowledge and learn from non-relational data in RRL.
method Differentiable Inductive Logic Programming (ILP) for learning relational information from images and incorporating expert knowledge.
result Efficacy demonstrated on various environments and datasets, showing improved learning and generalization.
Contradiction graphs reveal VC dimension threshold.
problem Determining VC dimension of concept classes.
method Study contradiction graphs of binary concept classes.
result Single contradiction graph determines VC dimension.
Ensembles of classification and regression trees remain popular machine learning methods because they define flexible non-parametric models that predict well and are computationally efficient both during training and testing. During induction of decision trees one aims to find predicates that are maximally informative …
Determining when two knots are equivalent (more precisely isotopic) is a fundamental problem in topology. Here we formulate this problem in terms of Predicate Calculus, using the formulation of knots in terms of braids and some basic topological results. Concretely, Knot theory is formulated in terms of a language with…
Triangulation filters spurious circuits in multilingual models.
problem Unreliable explanations of multilingual models across languages.
method Formalizes reference families and introduces triangulation as a causal acceptance rule.
result Triangulation provides a falsifiable standard for mechanistic claims.
Recurrent iterated function systems (RIFSs) are improvements of iterated function systems (IFSs) using elements of the theory of Marcovian stochastic processes which can produce more natural looking images. We construct new RIFSs consisting substantially of a vertical contraction factor function and nonlinear transform…
CNNs reveal retinal ganglion cell features, linking visual processing to neuroscience.
problem Understanding what CNNs learn about retinal neuronal circuits.
method Trained CNNs on white noise images to predict neural responses from salamander retinas.
result CNN filters resemble biological retinal components and ganglion cell receptive fields.
Proposes OpenKI for better web-scale knowledge extraction and alignment.
problem Combining OpenIE and KB for web-scale knowledge extraction and alignment.
method Instance-level inference using neighborhood information from KB and OpenIE extractions, with attention mechanisms.
result Significantly improves performance on OpenIE extractions and semi-structured data.
Transformers for binary decisions are sensitive to evidence order, leading to unreliable outcomes.
problem Order sensitivity in Transformers for binary decisions leads to unreliable outcomes.
method Formalized an expectation-realization gap and developed QMV and EDFL bounds.
result Uniform permutation mixtures reduce dispersion and improve reliability.
Deep learning helps predict epileptic seizures from EEG data.
problem Challenging prediction of epileptic seizures in medical domain.
method Applied deep learning and machine learning models to EEG data.
result Improved prediction of epileptic seizures.
Induction of common sense knowledge about prototypical sequences of events has recently received much attention. Instead of inducing this knowledge in the form of graphs, as in much of the previous work, in our method, distributed representations of event realizations are computed based on distributed representations o…
CDDN tackles visual relationship detection with context-dependent diffusion networks.
problem Combustion of combinatorial explosion in relation triplets detection.
method CDDN framework using semantic and visual scene graphs for adaptive information aggregation.
result CDDN achieves state-of-the-art performance on visual relationship detection datasets.
The model describing market dynamics after a large financial crash is considered in terms of the stochastic differential equation of Ito. Physically, the model presents an overdamped Brownian particle moving in the nonstationary one-dimensional potential under the influence of the variable noise intensity, dependin…
Research predicts cryptocurrency staking rewards with high accuracy.
problem Predicting cryptocurrency staking rewards.
method Two predictive methodologies: sliding-window average and linear regression models.
result ETH staking rewards can be forecasted with RMSE within 0.7% and 1.1% of the mean value for 1-day and 7-day look-aheads respectively.
TAWT improves cross-task learning efficiency and guarantees.
problem Improving cross-task learning efficiency and theoretical understanding.
method Target-Aware Weighted Training (TAWT) minimizing representation-based task distance.
result TAWT achieves non-asymptotic learning-theoretic guarantees and is effective in NLP tasks.
Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.
problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.
Paper improves deep learning models using contrastive predictive coding for semi-supervised learning.
problem Limited labeled data in semi-supervised learning.
method Contrastive predictive coding technique to improve deep learning models with unlabeled data.
result Proposed cpc-SSL and ccpc-SSL models effectively use unlabeled data, scaling well to large datasets.
New algorithm reveals piecewise affine structure of neural networks.
problem Lack of strong guarantees on deep neural networks' behavior in safety-critical applications.
method Developed a novel algorithm to compute the piecewise affine form of neural networks.
result Computed piecewise affine representations of neural networks with rectified linear unit activations.
New method learns distribution shifts caused by predictive models in social computing.
problem Learning distribution shifts due to predictive models in social computing.
method Reverse causal model with microfoundation for agents' actions.
result Effective in minimizing performative prediction risk.
New algorithm helps identify useful features in big data.
problem Challenges in selecting relevant features from high-dimensional data.
method HARVEST algorithm evaluates features in random subsets to identify potentially useful ones.
result Empirical analyses and simulations show the HARVEST algorithm is highly effective.
Automatically learns hierarchical soft concepts for LRNNs.
problem Lack of automated rule learning in LRNNs.
method Iterative top-down search through hypothesis space of Horn clauses.
result Automatically induced hierarchical soft concepts lead to deep LRNNs with competitive predictive power.
This research constructs hypercomplex structures from twistor spaces.
problem Understanding hyperkähler metrics and structures.
method Utilizing twistor spaces and Kodaira-Spencer deformation theory.
result Facilitates construction of hypercomplex structures on parameter spaces.
Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and app…
Proposes guidelines for developing medical AI products.
problem Lack of clear pathways for regulating medical AI.
method Statistical risk perspective and deep understanding of machine learning methodologies.
result Enhanced development of medical AI products and regulations.
RoNGBa: A Robustly Optimized Natural Gradient Boosting Training Approach with Leaf Number Clippingcs.LG
Improved natural gradient boosting with leaf number clipping for faster and better performance.
problem Slower training speed and poor performance on large datasets for natural gradient boosting.
method Leaf number clipping regularization to optimize hyperparameters and improve performance.
result Significant improvement in performance and up to 4.85x speed up on various datasets.
Framework controls uncertainty in LLMs without labels or probabilities.
problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.
Traditional relation extraction predicts relations within some fixed and finite target schema. Machine learning approaches to this task require either manual annotation or, in the case of distant supervision, existing structured sources of the same schema. The need for existing datasets can be avoided by using a univer…
Opinion Mining for Relating Subjective Expressions and Annual Earnings in US Financial Statementscs.CL
Financial statements contain quantitative information and manager's subjective evaluation of firm's financial status. Using information released in U.S. 10-K filings. Both qualitative and quantitative appraisals are crucial for quality financial decisions. To extract such opinioned statements from the reports, we built…
R2N learns interpretable rules and literals from numerical features.
problem Lack of expressive vocabulary in rule-based decision models.
method Relational Rule Network (R2N) learns literals and rules end-to-end.
result Learned literals improve prediction accuracy and rule conciseness.
Paper classifies heart sound recordings as normal or abnormal.
problem Classifying normal/abnormal heart sound recordings.
method Four steps: preprocessing, feature extraction, training, validation. Back propagation neural network used.
result Optimal threshold determined for distinguishing normal and abnormal.
Proposes using diffusion models for probabilistic stock market predictions.
problem Uncertainties in financial data make deterministic models ineffective for stock market predictions.
method Utilizes Denoising Diffusion Probabilistic Models (DDPM) and Masked Relational Transformer (MRT).
result Achieves state-of-the-art performance in stock movement prediction and portfolio management.
A method for optimizing under unknown Markovian data distributions.
problem Optimizing under unknown and indirectly observed probability distributions via Markovian data.
method Data-driven distributionally robust optimization model with Frank-Wolfe algorithm.
result The proposed method finds a stationary point efficiently and outperforms state-of-the-art methods.
Successful human-robot cooperation hinges on each agent's ability to process and exchange information about the shared environment and the task at hand. Human communication is primarily based on symbolic abstractions of object properties, rather than precise quantitative measures. A comprehensive robotic framework thus…
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of n-dimension…
Improved AdaBoost method handles label uncertainty and class overlap.
problem Overfitting and sensitivity to noise in AdaBoost.
method Optimizes conditional risk loss function, incorporating label confidence and trustworthiness.
result Improved performance in finite sample scenarios and robustness.
New method improves statistical interpolation for analyzing complex random structures.
problem Analyzing atypical random structures in statistical models.
method Introduces a large deviation upgrade to fully lifted interpolation.
result Allows for easier analysis of atypical random structures.
The causal compatibility question asks whether a given causal structure graph -- possibly involving latent variables -- constitutes a genuinely plausible causal explanation for a given probability distribution over the graph's observed variables. Algorithms predicated on merely necessary constraints for causal compatib…
Gen1S learns novel classes with 1-shot data using residual space and generative models.
problem Learning new classes with limited data in a growing dataset.
method Mapping embeddings to a residual space, using generative models to learn multi-modal distribution, and applying it as a structural prior.
result Consistent improvement over state-of-the-art methods in recognizing novel classes.
Mathematical models link perception and memory formation.
problem Linking perception and memory formation.
method Tensor decompositions and latent representations.
result Active semantic decoding process in perception.
Paper develops a framework for hyperbolic Monge-Ampère equation on strips, proving well-posedness and stability.
problem Addressing the rigidity-flexibility dichotomy for wrinkled patterns in thin elastic sheets.
method Develops hodograph transformation and parametrix-corrector decomposition to handle corner singularities and prove well-posedness.
result Proves existence and uniqueness of hodograph weak solutions and derives energy estimates for stability.
A new method learns interpretable decision rules using submodular optimization.
problem Learning interpretable decision rules from data.
method Submodular optimization approach for selecting rules from a large set.
result The method effectively learns interpretable rule sets from real datasets.
The availability of large idea repositories (e.g., the U.S. patent database) could significantly accelerate innovation and discovery by providing people with inspiration from solutions to analogous problems. However, finding useful analogies in these large, messy, real-world repositories remains a persistent challenge …
Data whitening and second order optimization harm generalization by reducing access to dataset information.
problem Harmful effects of data whitening and second order optimization on generalization in machine learning.
method Analysis of fully connected models and experimental verification.
result Data whitening and second order optimization reduce or prevent generalization by limiting access to dataset information.