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

Trend · papers per month

6121723 · Jul 202019922001200920182026
48 results for bAbI 20

Machine reading using differentiable reasoning models has recently shown remarkable progress. In this context, End-to-End trainable Memory Networks, MemN2N, have demonstrated promising performance on simple natural language based reasoning tasks such as factual reasoning and basic deduction. However, other tasks, namel…

2016-10-13abs ↗pdf ↗

We further study the incidence relations that arise from the various subtowers, known as Baby Monster, which exist within the R3\mathbb{R}^{3}-Monster Tower. This allows us to complete the RVTRVT class spelling rules. We also present a method of calculating the various Baby Monster that appear within the Monster Tower.

2014-07-07abs ↗pdf ↗

MAC Net improves natural language question answering with data-driven reasoning.

problem Natural Language Question Answering requires complex reasoning.
method MAC Net architecture separates memory and control for iterative reasoning.
result MAC Net achieves high efficiency and interpretability in NLP tasks.

The Monster tower, also known as the Semple tower, is a sequence of manifolds with distributions of interest to both differential and algebraic geometers. Each manifold is a projective bundle over the previous. Moreover, each level is a fiber compactified jet bundle equipped with an action of finite jets of the diffeom…

2015-12-01abs ↗pdf ↗

New algorithms minimize dynamic regret for strongly convex losses.

problem Minimizing dynamic regret for strongly convex losses.
method Developed Strongly Adaptive algorithms exploiting KKT conditions.
result Achieved near optimal dynamic regret of O(d1/3n1/3extTV[u1:n]2/3d)O(d^{1/3} n^{1/3} ext{TV}[u_{1:n}]^{2/3} \vee d).

Paper proposes a method to recover accurate labels from partially valid data in multi-label learning.

problem Tackles noisy supervision in multi-label learning with partially valid labels.
method Develops a two-stage method that estimates label enrichment and ground-truth confidences.
result Demonstrates improved performance over state-of-the-art PML methods.

The 20/60/20 rule improves risk management and portfolio optimization in finance.

problem Understanding and managing financial data with heavy tails.
method Application of the 20/60/20 rule to stock market data, development of new measures for tail heaviness, and integration into portfolio optimization.
result The 20/60/20 rule enhances robustness and performance in portfolio optimization.

For any positive integer r, we exhibit a knot Kr with (20 ×\times 2 r--1 + 1) crossings whose Jones polynomial V (Kr) is equal to 1 mod-ulo 2 r. Our construction rests on a certain 20-crossing tangle T 20 which is undetectable by the Kauffman bracket polynomial pair mod 2.

2016-10-18abs ↗pdf ↗

Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modif…

2015-11-17abs ↗pdf ↗

Pareto's 80/20 rule follows a Gaussian distribution with twice the mean standard deviation.

problem Understanding variations in the 80/20 rule across different contexts.
method Identifying the statistical distribution of the 80/20 rule and its variations.
result The 80/20 rule follows a Gaussian distribution with a standard deviation twice the mean.

The Knowledge Base (KB) used for real-world applications, such as booking a movie or restaurant reservation, keeps changing over time. End-to-end neural networks trained for these task-oriented dialogs are expected to be immune to any changes in the KB. However, existing approaches breakdown when asked to handle such c…

2018-05-03abs ↗pdf ↗

We present a novel recurrent neural network (RNN) based model that combines the remembering ability of unitary RNNs with the ability of gated RNNs to effectively forget redundant/irrelevant information in its memory. We achieve this by extending unitary RNNs with a gating mechanism. Our model is able to outperform LSTM…

2017-06-08abs ↗pdf ↗

Let J1\mathcal{J}^1 be the real form of a complex simple Jordan algebra such that the automorphism group is F4(20)\mathrm{F}_{4(-20)}. By using some orbit types of F4(20)\mathrm{F}_{4(-20)} on J1\mathcal{J}^1, for F4(20)\mathrm{F}_{4(-20)}, explicitly, we give the Iwasawa decomposition, the Oshima--Sekiguchi's KεK_ε-Iwasawa decomp…

2011-09-05abs ↗pdf ↗

Synthetic learning improves neonatal brain MRI segmentation robustness.

problem Challenges in neonatal brain MRI segmentation due to image contrast and anatomical variations.
method Synthetic learning model trained on few T2-weighted volumes, then enhanced with motion artifacts and over-segmentation.
result Synthetic learning robust to image contrast and improves segmentation of both T1- and T2-weighted images.

Oeljeklaus-Toma (OT) manifolds are certain compact complex manifolds built from number fields. Conversely, we show that the fundamental group often pins down the number field uniquely. We relate the first homology to some interesting ideal. OT manifolds are never Kähler, but carry an LCK metric (locally conformally Käh…

2015-03-07abs ↗pdf ↗

In this study, we investigate the limits of the current state of the art AI system for detecting buffer overflows and compare it with current static analysis tools. To do so, we developed a code generator, s-bAbI, capable of producing an arbitrarily large number of code samples of controlled complexity. We found that t…

2018-08-29abs ↗pdf ↗

Every year, thousands of people receive consumer product related injuries. Research indicates that online customer reviews can be processed to autonomously identify product safety issues. Early identification of safety issues can lead to earlier recalls, and thus fewer injuries and deaths. A dataset of product reviews …

2018-04-27abs ↗pdf ↗

Fair quantile regression adjusts estimators to balance subpopulation quantiles.

problem Unfair quantile estimators for subpopulations defined by a protected attribute.
method Proposes a procedure to adjust quantile estimators on heldout samples with protected attribute information.
result Demonstrates n\sqrt{n}-fairness, balancing target quantiles across subpopulations.

The paper studies hyperkähler structures and adapted complex structures using the Monge-Ampère equation.

problem Finding hyperkähler structures and adapted complex structures in tangent bundles.
method Analyzing the asymptotic expansion of the Monge-Ampère equation and using gauge transformations.
result Explicit computation of 4th order terms in the asymptotic expansion and equivalence to gauge transformations.

The divergence theorem in its usual form applies only to suitably smooth vector fields. For vector fields which are merely piecewise smooth, as is natural at a boundary between regions with different physical properties, one must patch together the divergence theorem applied separately in each region. We give an elegan…

1994-04-02abs ↗pdf ↗

New algorithms minimize dynamic regret in non-stationary online learning.

problem Universal dynamic regret minimization under exp-concave and smooth losses.
method Strongly Adaptive algorithms with a path variational based on second order differences of the comparator sequence.
result Achieve a dynamic regret of ildeO(d2n1/5Cn2/5d2) ilde O(d^2 n^{1/5} C_n^{2/5} \vee d^2), optimal modulo dependencies.

In Peña (2007), MCMC sampling is applied to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20 nodes. In the present paper, we extend that work from 20 to 31 nodes. We also extend that work by computing the approximate ratio of connected EGs to connected DAGs, of …

2013-01-30abs ↗pdf ↗

For any discrete, torsion-free subgroup ΓΓ of Sp(n,1)\mathrm{Sp}(n,1) (resp.\ F420\mathrm{F}_4^{-20}) with no parabolic elements, we prove that H4n1(Γ;V)=0H_{4n-1}(Γ;V)=0 (resp.\ Hi(Γ;V)=0H_i(Γ;V)=0 for i=13,14,15i=13,14,15) for any ΓΓ--module VV. The main technical advance is a new bound on the pp--Jacobian of the barycenter map of Besson--Cour…

2015-06-11abs ↗pdf ↗

The early layers of a deep neural net have the fewest parameters, but take up the most computation. In this extended abstract, we propose to only train the hidden layers for a set portion of the training run, freezing them out one-by-one and excluding them from the backward pass. Through experiments on CIFAR, we empiri…

2017-06-15abs ↗pdf ↗

We can overcome uncertainty with uncertainty. Using randomness in our choices and in what we control, and hence in the decision making process, could potentially offset the uncertainty inherent in the environment and yield better outcomes. The example we develop in greater detail is the news-vendor inventory management…

2016-01-14abs ↗pdf ↗

A graph is 2-apex if it is planar after the deletion of at most two vertices. Such graphs are not intrinsically knotted, IK. We investigate the converse, does not IK imply 2-apex? We determine the simplest possible counterexample, a graph on nine vertices and 21 edges that is neither IK nor 2-apex. In the process, we s…

2009-10-08abs ↗pdf ↗

This is lecture notes of a talk I gave at the Morningside Center of Mathematics on June 20, 2006. In this talk, I survey on Poincare and geometrization conjecture.

2006-07-31abs ↗pdf ↗

We prove the following: there are infinitely many finite-covolume (resp. cocompact) Coxeter groups acting on hyperbolic space H^n for every n < 20 (resp. n < 7). When n=7 or 8, they may be taken to be nonarithmetic. Furthermore, for 1 < n < 20, with the possible exceptions n=16 and 17, the number of essentially distinc…

2009-03-01abs ↗pdf ↗

Germany's tax admin costs likely exceed 20% of total revenue, requiring system improvement.

problem High tax administrative costs in Germany and other jurisdictions.
method Statistical data, surveys, and a novel approach to measure total administrative cost as a percentage of total tax revenue.
result Germany's 2021 tax administrative costs likely exceeded 20% of total tax revenue.

The study classifies complex parallelisable nilmanifolds with unobstructed deformations.

problem Characterizing complex parallelisable nilmanifolds with unobstructed deformations.
method Analyzing Lie algebras associated with nilmanifolds and their verbal ideals.
result There are finitely many complex homotopy types of unobstructed complex parallelisable nilmanifolds up to dimension 19, and infinitely many in dimension 20.

We address the question of the growth of firm size. To this end, we analyze the Compustat data base comprising all publicly-traded United States manufacturing firms within the years 1974-1993. We find that the distribution of firm sizes remains stable for the 20 years we study, i.e., the mean value and standard deviati…

1997-02-10abs ↗pdf ↗