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.

169,341 papers · 148 categories

Trend · papers per month

2356 · Jun 201919922001200920182026
48 results for predicate invention

Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.

problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.

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.

TSPRA integrates topics, sentiment, and user preference for better online review prediction and analysis.

problem Improving online review prediction and sentiment analysis accuracy.
method HDP-based model combining topics, sentiment, and user preference.
result Outperforms state-of-the-art model FLAME in rating prediction and sentiment analysis.

Paper converts quantiles to cumulative distribution functions to simplify risk measures.

problem Technical assumptions in risk measure calculations.
method Invention of converting integrated quantiles to integrated cumulative distribution functions.
result Avoids the need for probability density function existence.

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.

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 …

2012-06-18abs ↗pdf ↗

New method finds rare dense clusters in asymmetric binary perceptrons, resolving algorithmic hardness.

problem Resolving algorithmic hardness in asymmetric binary perceptrons.
method Fully lifted random duality theory (fl RDT) and large deviation upgrade (sfl LD RDT).
result Local entropy breaks down for constraint densities in (0.77, 0.78) interval, matching current solver limits.

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…

2012-09-17abs ↗pdf ↗

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.

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…

2013-04-07abs ↗pdf ↗

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.

We use the wrinkling theorem proven in Y. Eliashberg and N. Mishachev, "Wrinkling of smooth mappings and its applications - I", Invent. Math., 130(1997), 345-369, to fully describe the homotopy type of the space of S-immersions, i.e. equidimensional folded maps with prescribed folds.

2011-08-05abs ↗pdf ↗

This is one in a series of papers devoted to the foundations of Symplectic Field Theory sketched in [Y Eliashberg, A Givental and H Hofer, Introduction to Symplectic Field Theory, Geom. Funct. Anal. Special Volume, Part II (2000) 560--673]. We prove compactness results for moduli spaces of holomorphic curves arising in…

2003-08-19abs ↗pdf ↗

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.

In the present paper, we develop the parity theory invented in \cite{ManSb}; we construct new parities for two-component (virtual and free) links. New parities significantly depend on geometrical properties of diagrams; in particular, they are mutation-sensitive. New parities can be used practically in all problems, wh…

2015-08-23abs ↗pdf ↗

We show how the machine of PROP profiles invented by S. Merkulov can be used to study and classify natural operators in differential geometry. We also give an interpretation of graph complexes arising in this context in terms of representation theory. As application, we prove several results on classification of natura…

2006-12-07abs ↗pdf ↗

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.

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…

2013-12-18abs ↗pdf ↗

In this paper, we study the limiting properties of the KK energy for smooth hypersurfaces in the projective spaces. Our result generalizes the result of Ding-Tian (W. Ding and G. Tian. Kähler-Einstein metrics and the generalized Futaki invariant. {\em Invent Math}, 110:315-335, 1992.) in the case of hypersurfaces. In …

2001-08-02abs ↗pdf ↗

We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This result is an important step in the proof that the disk complex is Gromov hyperbolic…

2010-04-26abs ↗pdf ↗

We prove a generalization of Bennequin's inequality for Legendrian knots in a 3-dimensional contact manifold (Y,xi), under the assumption that Y is the boundary of a 4-dimensional manifold M and the version of Seiberg-Witten invariants introduced by Kronheimer and Mrowka [Invent. Math. 130 (1997) 209-255] is nonvanishi…

2004-10-26abs ↗pdf ↗

Using the reformulation in divergence form of the Euler-Lagrange equation for the Willmore functional as it was developed in "Analysis of the Willmore Functional" by T. Riviere (Invent. Math. 174), we study the limit of a local Palais-Smale sequence of weak Willmore immersions with locally square-integrable second fund…

2009-04-02abs ↗pdf ↗

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 UU under the influence of the variable noise intensity, dependin…

2008-07-14abs ↗pdf ↗

This study analyzes cryptocurrencies to reveal their homogeneity and heterogeneity.

problem Exploring the homogeneity and heterogeneity of cryptocurrency market performance and popularities.
method Examined 3607 actively exchanged cryptocurrencies to analyze their prices, volumes, blockchain transactions, coin difficulties, and public opinion.
result Identified strong correlation in market performance and imbalance in popularities and sophistications.

We define an extended Bloch group and show it is naturally isomorphic to H_3(PSL(2,C)^δ;Z). Using the Rogers dilogarithm function this leads to an exact simplicial formula for the universal Cheeger-Chern-Simons class on this homology group. It also leads to an independent proof of the analytic relationship between volu…

2003-07-08abs ↗pdf ↗

Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained numerical optimization. Although not usually interpreted thus, these are learning algorithms that fit a local quadratic approximation to the objective function. We show that many, including the most popular, quasi-Newto…

2012-06-18abs ↗pdf ↗

New meta-learning method outperforms human-designed architectures in dense image prediction tasks.

problem Designing efficient neural network architectures for dense image prediction.
method Recursive search space construction for multi-scale visual information.
result Meta-learning method achieves state-of-the-art performance on scene parsing, person-part segmentation, and semantic image segmentation.

The original k-means clustering method works only if the exact vectors representing the data points are known. Therefore calculating the distances from the centroids needs vector operations, since the average of abstract data points is undefined. Existing algorithms can be extended for those cases when the sole input i…

2013-03-24abs ↗pdf ↗

Following T.-J. Li, W. Zhang [Comparing tamed and compatible symplectic cones and cohomological properties of almost complex manifolds, Comm. Anal. Geom.], we continue to study the link between the cohomology of an almost-complex manifold and its almost-complex structure. In particular, we apply the same argument in [T…

2012-11-27abs ↗pdf ↗

A non-Hermitean extension of paradigmatic Wishart random matrices is introduced to set up a theoretical framework for statistical analysis of (real, complex and real quaternion) stochastic time series representing two "remote" complex systems. The first paper in a series provides a detailed spectral theory of non-Hermi…

2010-06-15abs ↗pdf ↗