Research
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,742 papers · 148 categories

Trend · papers per month

91182273364 · Jun 202019922001200920172026
48 results for Relational Constraints

New method uses logical relations to derive bounds and inequality constraints from causal models.

problem Recovering bounds and inequality constraints from unobserved confounding.
method Using rules of probability and restrictions on counterfactuals implied by causal graphical models.
result Powerful method to recover known and novel bounds and constraints.

This work presents entropic constraints from DAGs with hidden variables.

problem Characterizing causal relations in systems with hidden variables.
method Entropic inequality constraints derived from ee-separation relations.
result These constraints can learn about true causal models from observed data.

When the vacuum Einstein equations are cast in the form of hamiltonian evolution equations, the initial data lie in the cotangent bundle of the manifold MΣ of riemannian metrics on a Cauchy hypersurface Σ. As in every lagrangian field theory with symmetries, the initial data must satisfy constraints. But, unlike those …

2010-03-15abs ↗pdf ↗

The paper tackles sparse graph learning under Laplacian-related constraints, improving upon existing methods.

problem Learning a sparse undirected graph from multivariate data under Laplacian-related constraints.
method Modifications to penalized log-likelihood approaches to enforce total positivity and lasso/adaptive lasso penalties using ADMM.
result The proposed constrained adaptive lasso approach significantly outperforms existing Laplacian-based approaches.

We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the …

2011-05-04abs ↗pdf ↗

Unsupervised relation discovery aims to discover new relations from a given text corpus without annotated data. However, it does not consider existing human annotated knowledge bases even when they are relevant to the relations to be discovered. In this paper, we study the problem of how to use out-of-relation knowledg…

2019-04-19abs ↗pdf ↗

Study optimality conditions for interval-valued optimization problems on Riemannian manifolds.

problem Optimizing interval-valued functions on Riemannian manifolds under a total order relation.
method Generalized Hukuhara directional differentiability to derive KKT-type optimality conditions.
result Derives optimality conditions for interval-valued optimization problems on Riemannian manifolds.

This paper proposes Relational Similarity Machines (RSM): a fast, accurate, and flexible relational learning framework for supervised and semi-supervised learning tasks. Despite the importance of relational learning, most existing methods are hard to adapt to different settings, due to issues with efficiency, scalabili…

2016-08-02abs ↗pdf ↗

This work restricts hidden cardinality in causal models to infer causal relations.

problem Causal relations between variables with a common unobserved cause cannot be directly inferred.
method Derive inequality constraints from d-separation in causal models with known cardinalities of unobserved variables.
result Inference of causal relations is possible with additional assumptions about cardinalities.

We review the geometric formulation of the second Noether's theorem in time-dependent mechanics. The commutation relations between the dynamics on the final constraint manifold and the infinitesimal generator of a symmetry are studied. We show an algorithm for determining a gauge symmetry which is closely related to th…

2005-11-07abs ↗pdf ↗

Paper predicts multiple types of miRNA-disease associations using tensor decomposition.

problem Predicting miRNA-disease associations, especially multi-type ones.
method Represented miRNA-disease-type triplets as a tensor and used Tensor Decomposition methods.
result Tensor Decomposition methods improve a recent baseline by up to 38% in top-1 F1.

Paper tackles zero-shot learning for semantic image interpretation.

problem Extracting structured semantic descriptions from images requires complete training sets, which are often unavailable.
method Uses Logic Tensor Networks to leverage logical constraints and similarities among relationships in the training set.
result Background knowledge can alleviate the incompleteness of training sets, improving zero-shot learning performance.

Most of metric learning approaches are dedicated to be applied on data described by feature vectors, with some notable exceptions such as times series, trees or graphs. The objective of this paper is to propose a metric learning algorithm that specifically considers relational data. The proposed approach can take benef…

2018-07-02abs ↗pdf ↗

Adapts Bartnik method to Hilbert manifold structure for vacuum constraint equations.

problem Vacuum constraint equations on compact manifolds of any dimension ≥ 3.
method Adapts Bartnik method to provide Hilbert manifold structure.
result Fibers of scalar curvature and constraint operator are Hilbert submanifolds.

Recent work in learning ontologies (hierarchical and partially-ordered structures) has leveraged the intrinsic geometry of spaces of learned representations to make predictions that automatically obey complex structural constraints. We explore two extensions of one such model, the order-embedding model for hierarchical…

2017-08-01abs ↗pdf ↗

We calculate relations on characteristic classes which are obstructions preventing closed Kähler manifolds from carrying holomorphic Cartan geometries. We apply these relations to give global constraints on the phase spaces of complex analytic determined and underdetermined systems of differential equations.

2007-04-19abs ↗pdf ↗

A new framework for knowledge graph embedding using sheaves.

problem Learning representations for entities and relations in knowledge graphs.
method Using cellular sheaves to describe knowledge graph embeddings with consistency constraints.
result A generalized framework for reasoning about knowledge graph embedding models.

Proposes a method to improve hierarchical clustering using set-level structural priors.

problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.

For two solutions of the WDVV equations that are related by the inversion symmetry, we show that the associated principal hierarchies of integrable systems are related by a reciprocal transformation, and the tau functions of the hierarchies are related by a Legendre type transformation. We also consider relationships b…

2010-12-28abs ↗pdf ↗

Algorithm solves covariant exterior derivative equations in small regions.

problem Solving covariant exterior derivative equations in geometric and algorithmic ways.
method Linear homotopy operator of the Poincare lemma, constraints for parallel transport equations.
result Solves covariant constant and related equations in a geometric and algorithmic way.

Geodesic extensions for systems with nonholonomic constraints.

problem Extending equations of motion for systems with nonholonomic constraints.
method Constructing extensions to second-order ODEs, investigating geodesic conditions.
result Conditions for nonholonomic trajectories to be geodesics of a Riemannian metric.

The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classic…

2015-06-12abs ↗pdf ↗

A number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and we show that a wide range of convex optimization problems under submodular constr…

2013-09-26abs ↗pdf ↗

Deep learning for supervised learning has achieved astonishing performance in various machine learning applications. However, annotated data is expensive and rare. In practice, only a small portion of data samples are annotated. Pseudo-ensembling-based approaches have achieved state-of-the-art results in computer visio…

2019-02-11abs ↗pdf ↗

For two solutions of the WDVV equations that are related by two types of symmetries of the equations given by Dubrovin, we show that the associated principal hierarchies of integrable systems are related by certain reciprocal transformation, and the tau functions of the hierarchies are either identical or related by a …

2010-01-30abs ↗pdf ↗

Detects causal scenarios with inequality constraints among classical correlations.

problem Classifying causal structures and identifying those with inequality constraints.
method Using d-separation, e-separation, incompatible supports, and HLP condition.
result Resolved all but three causal scenarios with up to 4 observed variables.

One has not any conventional energy-momentum conservation law in Lagrangian field theory, but relations involving different stress-energy-momentum tensors associated with different connections. It is not obvious how to choose the true energy-momentum tensor. This problem is solved in the framework of the multimomentum …

1995-03-22abs ↗pdf ↗

Study on harmonic maps from surfaces to homogeneous spaces, focusing on bubble formation and geometric constraints.

problem Understanding the behavior of harmonic maps from surfaces to homogeneous spaces, especially in the presence of bubbles.
method Refined asymptotic expansions and obstruction relations for sequences developing a single bubble, geometric constraints for weakly conformal maps.
result New geometric constraints on the tangent planes of the limit map and bubble, depending on the dimensionality.

We discuss multi-task online learning when a decision maker has to deal simultaneously with M tasks. The tasks are related, which is modeled by imposing that the M-tuple of actions taken by the decision maker needs to satisfy certain constraints. We give natural examples of such restrictions and then discuss a general …

2009-02-20abs ↗pdf ↗

In this work, we use the global analysis and degree-theoretic methods introduced by Smale to study the existence and multiplicity of solutions of the vacuum Einstein constraint equations given by the conformal method of Lichnerowicz-Choquet-Bruhat-York. In particular this approach gives a new proof of the existence res…

2018-12-15abs ↗pdf ↗

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical norm. This result is convenient to apply in real applications and could yield re…

2015-10-06abs ↗pdf ↗