Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…
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,051 papers · 148 categories
Trend · papers per month
48 results for “declarative systems”
DisCoveR efficiently discovers declarative process models from event logs.
problem Mining declarative process models from event logs efficiently and accurately.
method DisCoveR precisely formalizes an algorithm, uses a bit vector implementation, and rigorously evaluates performance.
result DisCoveR outperforms other declarative miners in accuracy and runtime.
We describe DyNet, a toolkit for implementing neural network models based on dynamic declaration of network structure. In the static declaration strategy that is used in toolkits like Theano, CNTK, and TensorFlow, the user first defines a computation graph (a symbolic representation of the computation), and then exampl…
Object Files and Schemata: Factorizing Declarative and Procedural Knowledge in Dynamical Systemscs.LG
New architecture separates object state and behavior for better game dynamics.
problem Lack of systematicity in black-box models for dynamic environments.
method Factorizes declarative and procedural knowledge into object files and schemata.
result Improves generalization on environments with multiple object tokens.
Ludwig simplifies deep learning for non-experts.
problem Making deep learning accessible to non-experts.
method Type-based data abstraction and declarative configuration files.
result Ludwig democratizes deep learning, making it accessible to a broader audience.
We study the pricing problem for corporate defaultable bond from the viewpoint of the investors outside the firm that could not exactly know about the information of the firm. We consider the problem for pricing of corporate defaultable bond in the case when the firm value is only declared in some fixed discrete time a…
Helix speeds up iterative ML development by optimizing workflow execution.
problem Inefficient manual tuning of ML workflows.
method Declarative system that optimizes workflow execution end-to-end and across iterations, minimizing runtime per iteration.
result Up to an order of magnitude reduction in cumulative run time compared to state-of-the-art tools.
With pressure to increase graduation rates and reduce time to degree in higher education, it is important to identify at-risk students early. Automated early warning systems are therefore highly desirable. In this paper, we use unsupervised clustering techniques to predict the graduation status of declared majors in fi…
Paper uses social norms to teach robots human behavior.
problem Teaching robots to behave like humans in society.
method Captured social norms guide reinforcement learning towards normative behavior.
result Robots can learn normative behavior through automatic norm reward system.
We propose a technique for declaratively specifying strategies for semi-supervised learning (SSL). The proposed method can be used to specify ensembles of semi-supervised learning, as well as agreement constraints and entropic regularization constraints between these learners, and can be used to model both well-known h…
We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In ad…
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…
Blang simplifies Bayesian analysis for non-standard data types.
problem Bayesian inference for non-standard data structures.
method Bayesian declarative language, distribution continua, sequential Monte Carlo, non-reversible MCMC.
result Bayesian analysis on arbitrary data types is feasible and efficient.
Algorithm learns data structure in real-time with outliers and change points.
problem Sequential online prediction in the presence of outliers and change points.
method INTEL algorithm using WGPs and POE model for real-time structure learning.
result Significantly better performance than benchmarks in real datasets.
Paper augments neural nets with logic for improved performance.
problem Training neural networks with declarative knowledge without extra parameters.
method Systematically compiles logical statements into computation graphs that augment neural networks.
result Knowledge-augmented networks significantly improve performance, especially in low-data scenarios.
The paper evaluates income credibility using a hierarchical correlation reconstruction technique.
problem Automatic evaluation of credibility of exogenous variables like income based on endogenous variables.
method Adapted hierarchical correlation reconstruction technique for credibility evaluation, combining statistics with machine learning.
result The method allows for the automatic evaluation of credibility of income data, with high density values considered credible.
This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving as well as knowledge representation and reasoning. Thus, ASP is a good candidate for implementing p…
New neural networks with variable time constants for better time-series prediction.
problem Improving neural network performance in time-series prediction.
method Constructing networks of linear dynamical systems modulated by nonlinear gates, using numerical differential equation solvers.
result Liquid Time-Constant Networks (LTCs) yield superior performance on time-series prediction tasks.
TensorFlow Probability introduces JointDistributions for probabilistic programming.
problem Specifying models in probabilistic programming languages.
method Declarative representations of directed graphical models.
result JointDistributions for TensorFlow Probability.
Paper presents a model for identifying informative COVID-19 tweets.
problem Identifying informative COVID-19 tweets on Twitter.
method Leveraged transformers (RoBERTa, XLNet, BERTweet) trained in Semi-Supervised Learning (SSL) setting.
result Achieved F1 score of 0.9011 on test set, ranking 7th on leaderboard.
LIC compiles probabilistic models to generate efficient MCMC proposals.
problem Creating accurate Metropolis-Hastings proposals for Bayesian inference.
method Integrates probabilistic graphical models and neural networks in an open-source framework to optimize proposal distributions.
result LIC produces more efficient and robust MCMC proposals compared to existing methods.
Programmable Agentscs.AI
We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop di…
Two kernel Stein tests control decision errors in non-parametric model comparison.
problem Non-parametric multiple model comparison.
method Two statistical tests controlling false positive and false discovery rates.
result The first test has a higher true positive rate than the second under appropriate conditions.
LIFT uses demonstrations to train reinforcement learning controllers for data management tasks.
problem Large training data requirements, algorithmic instability, and lack of standard tools in reinforcement learning for data management.
method LIFT combines human demonstrations with deep reinforcement learning and TensorForce library.
result LIFT controllers trained from demonstrations outperform human baselines and heuristics in database and stream processing tasks.
Comment on a theorem about surface determination from map data.
problem Determining a Riemann surface from its Dirichlet-to-Neumann map.
method Critical remarks on a specific theorem.
result Criticism of a key theorem's validity.
GENO framework generates efficient solvers for machine learning problems.
problem Designing efficient solvers for machine learning problems.
method GENO framework combines a modeling language with a generic solver to generate solvers from optimization problem specifications.
result Automatically generated solvers are as efficient as well-engineered specialized solvers and orders of magnitude more efficient than classical modeling language plus solver approaches.
We consider an insurance entity endowed with an initial capital and a surplus process modelled as a Brownian motion with drift. It is assumed that the company seeks to maximise the cumulated value of expected discounted dividends, which are declared or paid in a foreign currency. The currency fluctuation is modelled as…
A new method for math reasoning that allows for iterative correction.
problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.
Forecastability measures predictive information across horizons.
problem How much predictive information is available at each prediction horizon?
method Develops the consequences of mutual information between future observations and information set.
result Forecastability is a profile reflecting process dependence structure, with properties like compression and truncation error.
The Euclidean cone metrics coming from q-differentials on a closed surface of genus g > 1 define an equivalence relation on homotopy classes of closed curves declaring two to be equivalent if they have the equal length in every such metric. We prove an analog of the result of Randol for hyperbolic metrics (building on …
There are no solid arguments to sustain that digital currencies are the future of online payments or the disruptive technology that some of its former participants declared when used to face critiques. This paper aims to solve the cryptocurrency puzzle from a behavioral finance perspective by finding the parallelism be…
Improved portfolio optimization reduces sensitivity to neural network initialization.
problem High sensitivity to neural network initialization in portfolio optimization.
method Robust end-to-end framework for risk budgeting portfolios.
result Enhanced stability in portfolio optimization without compromising performance.
We discuss memory models which are based on tensor decompositions using latent representations of entities and events. We show how episodic memory and semantic memory can be realized and discuss how new memory traces can be generated from sensory input: Existing memories are the basis for perception and new memories ar…
System detects financial forecasts in tweets, achieving high precision.
problem Detecting financial forecasts in social media messages.
method Natural Language Processing and Machine Learning techniques for real-time analysis.
result Achieves over 90% precision for financial forecasts.
New approach treats coordination as an architectural layer to improve LLM-based multi-agent systems.
problem Coordination defects lead to high failure rates in LLM-based multi-agent systems.
method Treats coordination as a configurable architectural layer separable from agent logic and information access.
result Configurations leave distinguishable signatures, enabling architectural reasoning and Pareto frontiers.
In his 1954 paper about the initial value problem for 2D hyperbolic nonlinear PDEs, P. Lax declared that he had "a strong reason to believe" that there must exist a well-defined class of "not genuinely nonlinear" nonlinear PDEs. In 1978 G. Boillat coined the term "completely exceptional" to denote it. In the case of $2…
The study develops a logic reasoner to verify MS case management specifications.
problem Ensuring correctness and solvability of abstract clinical work products.
method Developed a logic reasoner using UML class and state diagrams, SPIN, and ODM.
result Formal representations of UML diagrams proved consistent for MS case management.
Asymmetry PRISM outperforms CPU and GPU solvers for institutional rebalancing.
problem Institutional rebalancing with deadline constraints
method Asymmetry PRISM
result Asymmetry PRISM-CPU is 4.5x to 24.1x faster than the fastest completed reference row in the same lane.
CUBE explains models by balanced experiments and contrasts.
problem Post-hoc explanation of trained predictive models.
method Design-based framework using balanced low-high probes.
result Reveals dominant learned effect structure and clarifies query efficiency.
Artificial intelligence (AI) generally and machine learning (ML) specifically demonstrate impressive practical success in many different application domains, e.g. in autonomous driving, speech recognition, or recommender systems. Deep learning approaches, trained on extremely large data sets or using reinforcement lear…
Scenario Constraints with Memory: A Finite-State Approach to Quantitative Financial Analysisq-fin.CP
A framework for analyzing financial systems under scenario constraints.
problem Quantifying worst-case and best-case performance in financial systems.
method Quantitative automata-based framework integrating event history automata and weighted finance finite automata.
result Exact calculation of upper and lower payoff bounds with interpretable witness event histories.
Modyn automates continuous ML model training on growing datasets.
problem Continuous model retraining is costly and impractical.
method Data-centric ML platform with policies for continuous training.
result Modyn enables high throughput training with sample-level data selection.
System exposes study population descriptions in clinical guidelines.
problem Challenges in understanding applicability of clinical guidelines.
method Developed an ontology-enabled prototype system using SIO.
result Allows medical practitioners to better understand study populations.
Study on Parisian ruin with hybrid observation times.
problem Calculating Parisian ruin under a hybrid observation scheme.
method Hybrid observation scheme with Poisson arrivals and continuous monitoring below zero.
result Improved results and fluctuation identities in terms of second-generation scale functions.
Tensor models decode human perception and memory using SPO triples.
problem Understanding implicit and explicit perception and memory in the brain.
method Tensor models with SPO triples, dual representations, and four layers.
result Semantic memory is crucial for explicit perception and declarative memories.
Paper tackles learning probabilistic logic programs for continuous data.
problem Learning meaningful symbolic representations from continuous data.
method Leverages piecewise polynomial function approximation theory for density function learning.
result First steps towards inducing probabilistic logic programs for continuous data.
We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on rank-SVM. Data points are first ranked based on scores derived from nearest neighbor graphs on n-point nominal data. We then train a rank-SVM using this ranked data. A test-point is declared as an anomaly at alpha-…
CausalForge automates causal inference research with formal proofs and self-improvement.
problem Unreliable evaluation of automated research results by large language models.
method Formal proof assistant (Lean) and self-improving agentic pipeline.
result Automated research produces reliable formal proofs and artifacts.