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

Trend · papers per month

71142212283 · Jun 202019922001200920172026
48 results for Call Center Conversations

ACI converts call center conversations into actionable data.

problem Real-time spoken language understanding for call center conversations.
method Combines speech recognition, entity and intent recognition, and a business rules engine.
result ACI converts live audio into structured events for real-time supervision and assistance.

We show that in all dimensions >7 there are closed aspherical manifolds whose fundamental groups have nontrivial center but do not possess any topological circle actions. This disproves a conjectured converse (proposed by Conner and Raymond) to a classical theorem of Borel.

2011-08-11abs ↗pdf ↗

End-to-end deep learning detects emotions in real-life emergency calls.

problem Recognizing emotions in real-life emergency call center recordings.
method Used an end-to-end deep learning architecture trained on IEMOCAP and CEMO datasets.
result Obtained 45.6% Unweighted Accuracy Recall on CEMO with 4 classes, 76.9% on 2 classes (Anger, Neutral).

There has been growing interest in using neural networks and deep learning techniques to create dialogue systems. Conversational recommendation is an interesting setting for the scientific exploration of dialogue with natural language as the associated discourse involves goal-driven dialogue that often transforms natur…

2018-12-18abs ↗pdf ↗

HRL improves open-domain dialog models by optimizing long-term conversational goals.

problem Challenges in open-domain dialog generation, including repetitive outputs, difficulty tracking conversational goals, and inappropriate text.
method Proposes VHRL, a hierarchical reinforcement learning approach using policy gradients to tune utterance-level embeddings of a variational sequence model.
result Significant improvements in human evaluation and automatic metrics over state-of-the-art dialog models.

A Riemannian manifold is called harmonic if its volume density function expressed in polar coordinates centered at any point is radial. Flat and rank-one symmetric spaces are harmonic. The converse (the Lichnerowicz Conjecture) is true for manifolds of nonnegative scalar curvature and for some other classes of manifold…

2004-07-02abs ↗pdf ↗

DGDS uses documents to center conversations, promising broader AI understanding.

problem DS classification by function is insufficient for complex conversations.
method Classify DS based on document grounding, analyzing classification, architecture, datasets, and models.
result DGDS can better represent current DS development trends and future AI understanding.

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.

This paper proposes a voice conversion (VC) method using sequence-to-sequence (seq2seq or S2S) learning, which flexibly converts not only the voice characteristics but also the pitch contour and duration of input speech. The proposed method, called ConvS2S-VC, has three key features. First, it uses a model with a fully…

2018-11-05abs ↗pdf ↗

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…

2016-03-09abs ↗pdf ↗

MaskCycleGAN-VC improves voice conversion without parallel data.

problem Limited ability to convert mel-spectrogram data without parallel data.
method Integrates a novel auxiliary task called filling in frames (FIF) to learn time-frequency structures.
result MaskCycleGAN-VC outperforms existing methods with similar model size.

A new algorithm for conversational recommendation systems using dueling bandits in GLMs.

problem Limited user feedback in existing conversational bandit methods.
method Integrates dueling bandits with relative feedback in generalized linear models.
result Theoretical and empirical validation of ConDuel's efficacy.

Study on a specific type of Lie algebras with Kähler and contact properties.

problem Characterizing and classifying transversely Kähler almost contact metric Lie algebras.
method Analyzing properties of Lie algebras with contact forms and Kähler structures, considering center dimensions and quotient properties.
result Classification of 5-dimensional η-Einstein transversely Kähler almost contact metric Lie algebras.

We call the Lie algebra of a Lie group with a left invariant pseudo-Riemannian flat metric pseudo-Riemannian flat Lie algebra. We give a new proof of a classical result of Milnor on Riemannian flat Lie algebras. We reduce the study of Lorentzian flat Lie algebras to those with trivial center or those with degenerate ce…

2011-03-03abs ↗pdf ↗

Correntropy is a local similarity measure defined in kernel space and the maximum correntropy criterion (MCC) has been successfully applied in many areas of signal processing and machine learning in recent years. The kernel function in correntropy is usually restricted to the Gaussian function with center located at ze…

2019-04-13abs ↗pdf ↗

Deep learning models price convertible bonds with complex reset and call features.

problem Pricing convertible bonds with path-dependent reset and call provisions.
method Formulated as a PPDE, deep learning approximates conditional expectations.
result Deep learning produces stable and accurate prices across various model specifications.

Archimedes determined the center of gravity of a parabolic section as follows. For a parabolic section between a parabola and any chord ABAB on the parabola, let us denote by PP the point on the parabola where the tangent is parallel to ABAB and by VV the point where the line through PP parallel to the axis of the p…

2015-02-01abs ↗pdf ↗

Let G=(V,E)G=(V,E) be a connected finite graph. In this short paper, we reinvestigate the Kazdan-Warner equation Δu=cheuΔu=c-he^u with c<0c<0 on GG, where hh defined on VV is a known function. Grigor'yan, Lin and Yang \cite{GLY} showed that if the Kazdan-Warner equation has a solution, then h\overline{h}, the average value …

2016-11-28abs ↗pdf ↗

New random forest method provides optimal rates and confidence bands.

problem Improving random forest regression rates and constructing confidence bands.
method Proposed Ehrenfest centered purely random forests achieve optimal rates; used Gaussian approximation for supremum of empirical processes.
result Explicit asymptotic uniform confidence bands constructed for both random forest types.

Paper introduces methods to automatically generate SOAP notes from patient-physician conversations.

problem Burden of creating digital SOAP notes by physicians.
method Cluster2Sent algorithm for summarizing patient-physician conversations.
result Cluster2Sent algorithm outperforms existing methods by 8 ROUGE-1 points.

The Riemannian center of mass was constructed in [GrKa] (1973). In [GKR1, GKR2, Gr, Ka, BuKa] (1974-1981) it was successfully applied with more refined estimates. Probably in 1990 someone renamed it without justification into karcher mean and references to the older papers were omitted by those using the new name. As a…

2014-07-03abs ↗pdf ↗

The (relativistic) center of mass of an asymptotically flat Riemannian manifold is often defined by certain surface integral expressions evaluated along a foliation of the manifold near infinity, e. g. by Arnowitt, Deser, and Misner (ADM). There are also what we call 'abstract' definitions of the center of mass in term…

2013-12-22abs ↗pdf ↗

New measures link neural representation geometry to decoding ability.

problem Understanding how neural representations relate to decoding ability.
method Showed that popular similarity measures can be interpreted from a decoding perspective.
result Proved that measures like CKA and CCA quantify alignment between optimal linear readouts.

It is shown by several authors going back to Huisken-Yau that asymptotically Schwarzschildean time-slices possess a unique foliation by stable constant mean curvature (CMC) spheres defining the so-called CMC center of mass. We analyze how the leaves of this foliation evolve in time under the Einstein equations. More pr…

2013-12-21abs ↗pdf ↗

Artin groups of type DnD_n have special cycles and complexes with interesting properties.

problem Characterizing cycles and complexes in Artin groups of type DnD_n.
method Analyzing 6-cycles and their centers/quasi-centers in the 1-skeleton of the Artin complex.
result Certain 6-cycles in the Artin complex of type DnD_n have centers or quasi-centers.

New method for better initial centers in clustering with improved accuracy and privacy.

problem Improving the quality of clustering centers in metric spaces.
method HST initialization based on metric embedding tree structure, combined with efficient search algorithm and DP extension.
result HST initialization produces better initial centers than kk-median++ with comparable efficiency and improved privacy.

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.

Predicting conversion rates (CVRs) in display advertising (e.g., predicting the proportion of users who purchase an item (i.e., a conversion) after its corresponding ad is clicked) is important when measuring the effects of ads shown to users and to understanding the interests of the users. There is generally a time de…

2018-02-01abs ↗pdf ↗

We find that for any n-dimensional, compact, convex subset K of R^{n+1} there is an affinely-spherical hypersurface M in R^{n+1} with center at the relative interior of K, such that the disjoint union of M and K is the boundary of an (n+1)-dimensional, compact, convex set. This so-called affine hemisphere M is uniquely…

2015-08-03abs ↗pdf ↗

This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian…

2015-03-31abs ↗pdf ↗

This thesis discusses the Newtonian limit of General Relativity for static isolated systems with compactly supported matter. We call these systems "geometrostatic" to underline their geometric nature. We introduce new quasi-local notions of mass and center of mass that can be read off locally in the vicinity of the mat…

2012-01-26abs ↗pdf ↗

In this note, we show that for any harmonic map into a non-compact symmetric space one can find naturally a "dual" harmonic map into a compact symmetric space which can be constructed from the same basic data (called "potentials" in the loop group formalism). Locally also the inverse/converse duality theorem holds.

2019-03-03abs ↗pdf ↗