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

0.4%0.8%1.2%1.6% · Apr 200019922001200920172026
48 results for open-domain

Study finds neural dialog models struggle with conversational tasks.

problem Insufficient understanding of dialog by neural models.
method Analysis of internal representations and evaluation of model performance.
result Neural dialog models lack key conversational skills like answering questions and inferring contradiction.

This study compares hierarchical and non-hierarchical models for open-domain multi-turn dialog generation.

problem Which kind of models (hierarchical or non-hierarchical) is better for open-domain multi-turn dialog generation?
method Systematically compared nearly all representative hierarchical and non-hierarchical models over the same experimental settings.
result Nearly all hierarchical models are worse than non-hierarchical models in open-domain multi-turn dialog generation, except for HRAN.

Meena is a chatbot trained on social media data, achieving human-like conversation quality.

problem Creating a chatbot that can have human-like conversations in an open-domain setting.
method End-to-end training of a 2.6B parameter neural network on social media data, using perplexity and a human evaluation metric (SSA) to assess quality.
result Meena achieves a high human-like conversation quality (79% SSA) when compared to existing chatbots.

New domains of discontinuity found for Anosov representations.

problem Understanding Anosov representations acting on homogeneous spaces.
method Constructing open domains of discontinuity for Anosov representations acting on specific homogeneous spaces.
result Describes the largest possible open domains of discontinuity for Zariski dense Anosov representations.

Open-domain dialog generation is a challenging problem; maximum likelihood training can lead to repetitive outputs, models have difficulty tracking long-term conversational goals, and training on standard movie or online datasets may lead to the generation of inappropriate, biased, or offensive text. Reinforcement Lear…

2019-09-17abs ↗pdf ↗

Paper develops a model for verifying facts in tables without pre-retrieved evidence.

problem Verification of factual claims in structured data, especially in open-domain settings.
method Joint reranking-and-verification model that fuses evidence documents.
result Model achieves comparable performance to closed-domain state-of-the-art on TabFact dataset.

An increasing number of datasets contain multiple views, such as video, sound and automatic captions. A basic challenge in representation learning is how to leverage multiple views to learn better representations. This is further complicated by the existence of a latent alignment between views, such as between speech a…

2018-11-21abs ↗pdf ↗

The reduction of biharmonic maps equation in terms of the Maurer-Cartan form for all smooth map of any compact Riemannian manifolds into a compact Lie group with bi-invariant Riemannian metric is obtained. By this formula, all the biharmonic curves into a compact Lie group and all biharmonic maps from a 2-dimensional o…

2009-10-05abs ↗pdf ↗

In this paper, the description of biharmonic map equation in terms of the Maurer-Cartan form for all smooth map of a compact Riemannian manifold into a Riemannian symmetric space (G/K,h)(G/K,h) induced from the bi-invariant Riemannian metric hh on GG is obtained. By this formula, all biharmonic curves into symmetric space…

2011-01-17abs ↗pdf ↗

In this paper we analyze the problem of the geodesic connectedness of subsets of Riemannian manifolds. By using variational methods, the geodesic connectedness of open domains (whose boundaries can be not differentiable and not convex) of a smooth Riemannian manifold is proved. In some cases also the convexity of the d…

2000-04-12abs ↗pdf ↗

End-to-end speech recognition system trained on GPUs and CPUs.

problem Building state-of-the-art speech recognition systems.
method Utilizes CPUs and GPUs for training, data augmentation, and neural network updates. Uses vocal tract length perturbation and acoustic simulator for data augmentation. Employed Horovod allreduce for training.
result Achieved 7.92% WER on proprietary English Bixby open domain test set using a Bidirectional Full Attention (BFA) model.

A family of probability distributions parametrized by an open domain ΛΛ in RnR^n defines the Fisher information matrix on this domain which is positive semi-definite. In information geometry the standard assumption has been that the Fisher information matrix tensor is positive definite defining in this way a Riemannia…

2015-03-29abs ↗pdf ↗

We consider an open domain with a compact boundary in an Euclidean space and a Schroedinger operator with magnetic field on this domain. We give sufficient conditions on the rate of growth of the magnetic field near the boundary which guarantees essential self-adjointness of this operator. From the physical point of vi…

2009-03-04abs ↗pdf ↗

In this paper we find, for any arbitrary finite topological type, a compact Riemann surface M,\mathcal{M}, an open domain MMM\subset\mathcal{M} with the fixed topological type, and a conformal complete minimal immersion X:MR3X:M\to\R^3 which can be extended to a continuous map X:MˉR3,X:\bar{M}\to\R^3, such that $X_{|\partial M…

2007-11-15abs ↗pdf ↗

Study shows distance to boundary is always attained on varifolds with bounded curvature.

problem Understanding varifolds with bounded mean curvature in Riemannian manifolds.
method Proves a barrier principle at infinity using sharp maximum principles.
result Distance to boundary is always attained on varifolds with bounded curvature.

We present MILABOT: a deep reinforcement learning chatbot developed by the Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize competition. MILABOT is capable of conversing with humans on popular small talk topics through both speech and text. The system consists of an ensemble of natural langu…

2018-01-20abs ↗pdf ↗

Let (Xm+1,g)(X^{m+1}, g) be a globally hyperbolic spacetime with Cauchy surface diffeomorphic to an open subset of Rm\mathbb R^m. The Legendrian Low conjecture formulated by Natário and Tod says that two events x,yßx,y\inß are causally related if and only if the Legendrian link of spheres Sx,Sy\mathfrak S_x, \mathfrak S_y whose p…

2008-10-28abs ↗pdf ↗

Study of SU(2,1) character varieties on one-holed torus.

problem Characterize representations of mapping class group on SU(2,1) character variety.
method Explicit description of SU(2,1) character variety, use of Farey graph adaptation, and mapping class group action analysis.
result Description of an open domain of discontinuity for mapping class group action.

Text embedding representing natural language documents in a semantic vector space can be used for document retrieval using nearest neighbor lookup. In order to study the feasibility of neural models specialized for retrieval in a semantically meaningful way, we suggest the use of the Stanford Question Answering Dataset…

2018-10-24abs ↗pdf ↗

ClovaCall introduces a new Korean call speech corpus for contact centers.

problem Lack of large-scale call-based speech corpora for Korean dialog scenarios.
method Development of a new large-scale Korean call-based speech corpus (ClovaCall) in a restaurant reservation domain.
result Validation of the dataset with ASR models shows its effectiveness.

Let u1u_1 and u2u_2 be two different positive smooth solutions of the equation Δu+n(n2)un+2n2=0Δu + n (n - 2) u^{{n + 2}\over {n - 2}} = 0 in Rn(n3).R^n (n \ge 3). By a result of Gidas, Ni and Nirenberg, u1u_1 and u2u_2 are radially symmetric above the points ξ1ξ_1 and ξ2ξ_2, respectively. Let uu be a positive C2C^2-function on RnR^n su…

2002-02-23abs ↗pdf ↗

For a standard Finsler metric F on a manifold M, its domain is the whole tangent bundle TM and its fundamental tensor g is positive-definite. However, in many cases (for example, the well-known Kropina and Matsumoto metrics), these two conditions are relaxed, obtaining then either a pseudo-Finsler metric (with arbitrar…

2011-11-22abs ↗pdf ↗

The current article studies certain problems related to complex cycles of holomorphic foliations with singularities in the complex plane. We focus on the case when polynomial differential one-form gives rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a nontrivial element of the f…

2010-05-11abs ↗pdf ↗

Study combines chit-chat and goal-oriented dialogue in fantasy games.

problem Combining naturalistic chit-chat with goal-oriented tasks in fantasy games.
method Trained a goal-oriented model with reinforcement learning against an imitation-learned chit-chat model using two approaches.
result Both models outperform a baseline and can converse naturally to achieve goals.

Bayesian optimisation with graph kernels improves neural architecture search and provides interpretability.

problem Lack of insight into why architectures perform well and how to improve them.
method Combines Bayesian optimisation with Weisfeiler-Lehman graph kernels for highly data-efficient and interpretable architecture search.
result Demonstrates state-of-the-art performance on closed- and open-domain search spaces.

Deep learning approaches have recently achieved impressive performance on both audio source separation and sound classification. Most audio source separation approaches focus only on separating sources belonging to a restricted domain of source classes, such as speech and music. However, recent work has demonstrated th…

2019-11-18abs ↗pdf ↗

Study of Bowditch representations in hyperbolic spaces with implications for dynamics and recognition.

problem Characterizing and understanding representations of free groups into hyperbolic spaces.
method Generalization of Bowditch conditions, explicit constant KδK_δ for hyperbolicity, characterizations of representations.
result Linear growth of lengths for primitive elements in Bowditch representations, new characterization of primitive-stable representations.

Study of pseudoconvex 3-manifolds in complex surfaces.

problem Understanding pseudoconvex 3-manifolds in complex surfaces.
method Develop tools for constructing topologically pseudoconvex embeddings and classify almost-complex structures.
result Every closed, oriented 3-manifold can be embedded in a compact complex surface realizing any homotopy class of almost-complex structures.

Study optimal investment and consumption in a stochastic factor model.

problem Optimal investment and consumption decisions in a stochastic factor model.
method Characterization of well-posedness, numerical algorithm, and general theory of sub- and supersolutions for HJB equation.
result Proves existence and provides bounds for the solution to the HJB equation.

Let G be a split semisimple algebraic group with trivial center. Let S be a compact oriented surface, with or without boundary. We define {\it positive} representations of the fundamental group of S to G(R), construct explicitly all positive representations, and prove that they are faithful, discrete, and positive hype…

2003-11-10abs ↗pdf ↗

The paper constructs a free abelian group from Anosov representations on bundles.

problem Constructing a free abelian group from Anosov representations on bundles.
method Extending the Γ\Gamma-action via ρ\rho to the space of connections on pullbacks of tangent bundles.
result A free abelian group FabF^{ab} is constructed and acts properly discontinuously on it.