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

Trend · papers per month

316394125 · May 202619922001200920172026
48 results for signal conversion

A new framework converts EEG signals between subjects and tasks.

problem Noise and variability in EEG data hinder generalizable signal extraction.
method Contrastive Split-Latent Permutation Autoencoder (CSLP-AE) framework.
result The CSLP-AE framework enables zero-shot conversion between unseen subjects.

We propose a nonparallel data-driven emotional speech conversion method. It enables the transfer of emotion-related characteristics of a speech signal while preserving the speaker's identity and linguistic content. Most existing approaches require parallel data and time alignment, which is not available in most real ap…

2018-11-03abs ↗pdf ↗

The majority of conversations a dialogue agent sees over its lifetime occur after it has already been trained and deployed, leaving a vast store of potential training signal untapped. In this work, we propose the self-feeding chatbot, a dialogue agent with the ability to extract new training examples from the conversat…

2019-01-16abs ↗pdf ↗

Estimates conversion probabilities from click sequences with privacy constraints.

problem Training models in advertising with limited direct click-conversion links.
method Formalizes learning from attribution sets, constructs unbiased estimator, applies Empirical Risk Minimization.
result Empirical Risk Minimization achieves generalization guarantees and robustness against prior errors.

Most of the existing studies on voice conversion (VC) are conducted in acoustically matched conditions between source and target signal. However, the robustness of VC methods in presence of mismatch remains unknown. In this paper, we report a comparative analysis of different VC techniques under mismatched conditions. …

2016-12-22abs ↗pdf ↗

New method converts conventional ANNs to SNNs with minimal loss and efficiency.

problem Difficulty in training SNNs directly from conventional ANNs due to discreteness.
method Proposes a novel pipeline combining threshold balance and soft-reset mechanisms for efficient conversion.
result Achieves almost no accuracy loss with only 1/10 of typical SNN simulation time.

We present a fully convolutional wav-to-wav network for converting between speakers' voices, without relying on text. Our network is based on an encoder-decoder architecture, where the encoder is pre-trained for the task of Automatic Speech Recognition, and a multi-speaker waveform decoder is trained to reconstruct the…

2019-04-18abs ↗pdf ↗

Paper improves privacy-preserving measurement of advertising incrementality.

problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.

Voice-enabled interactions provide more human-like experiences in many popular IoT systems. Cloud-based speech analysis services extract useful information from voice input using speech recognition techniques. The voice signal is a rich resource that discloses several possible states of a speaker, such as emotional sta…

2019-08-09abs ↗pdf ↗

Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem, in an other auxiliary game. We establish the converse: a strategy that approaches a convex BB-set can be…

2010-06-09abs ↗pdf ↗

Toward enabling next-generation robots capable of socially intelligent interaction with humans, we present a computational  model\mathbf{computational\; model} of interactions in a social environment of multiple agents and multiple groups. The Multiagent Group Perception and Interaction (MGpi) network is a deep neural network that predi…

2019-03-04abs ↗pdf ↗

New model for recovering unverifiable signals from observers in decentralized networks.

problem Verifying the level of service provided by untrusted parties in decentralized networks.
method Formal model of signal elicitation, source identifiability condition, and peer prediction techniques.
result Existence of a strictly truthful mechanism for unverifiable signal recovery.

Study examines cash conversion cycle in manufacturing firms, finding negative relationships with profitability and size.

problem Understanding cash conversion cycle in manufacturing firms and its impact on profitability and size.
method Empirical study of 30 manufacturing firms in Dhaka Stock Exchanges, categorizing them into six industries, analyzing industry averages and relationships with size and profitability.
result Negative relationship between cash conversion cycle and profitability, especially ROE; negative relationship with firm size in terms of net sales.

FedConPE improves conversational recommender systems efficiency and privacy.

problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.

Study on benign overfitting in leaky ReLUs with moderate input dimensions.

problem Understanding when overfitting is beneficial in neural networks.
method Two-layer leaky ReLU networks trained with hinge loss, considering signal-to-noise ratio.
result Characterization of conditions for benign overfitting based on signal-to-noise ratio.

Contextual bandit algorithms provide principled online learning solutions to balance the exploitation-exploration trade-off in various applications such as recommender systems. However, the learning speed of the traditional contextual bandit algorithms is often slow due to the need for extensive exploration. This poses…

2019-06-04abs ↗pdf ↗

Efficient method for tensor linear form inference with noisy incomplete data.

problem Statistical inference of tensor linear forms with incomplete and noisy observations.
method Initial estimate + debiasing + one-step power iteration.
result Optimal uncertainty quantification and statistical-to-computational gaps examined.

The goal of online display advertising is to entice users to "convert" (i.e., take a pre-defined action such as making a purchase) after clicking on the ad. An important measure of the value of an ad is the probability of conversion. The focus of this paper is the development of a computationally efficient, accurate, a…

2017-10-24abs ↗pdf ↗

CycleGAN-VC3 improves CycleGAN-VCs for mel-spectrogram conversion.

problem Ambiguity in CycleGAN-VC/VC2 effectiveness for mel-spectrogram conversion.
method Proposes CycleGAN-VC3 with time-frequency adaptive normalization (TFAN).
result CycleGAN-VC3 outperforms or matches CycleGAN-VC2 for mel-spectrogram conversion.

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.

The paper extracts structured data from physician-patient conversations, reducing clerical burden.

problem Mining insights from physician-patient conversations for electronic health record documentation.
method Created a dataset of transcripts and summaries, extracted noteworthy utterances, and improved model performance.
result Extracting noteworthy utterances significantly boosts model performance for recognizing diagnoses and RoS abnormalities.

Schedule-free SGD is optimal for nonconvex optimization problems.

problem Nonconvex optimization in neural networks.
method Developed a general framework for online-to-nonconvex conversion, which converts schedule-free SGD into an effective nonconvex optimization algorithm.
result Schedule-free SGD achieves optimal iteration complexity for nonsmooth, nonconvex optimization problems.

Improved conversion rate prediction in online advertising using self-supervised pre-training.

problem Data sparsity and calibration issues in predicting conversions given clicks.
method Self-supervised pre-training on all conversion events to enrich CVR prediction model without compromising calibration.
result Improvements in offline training and online A/B tests, with full deployment to Yahoo native advertising system.

Unified approach to tensor PCA and related problems using tensor cumulants.

problem Statistical inference on invariant distributions, particularly tensor PCA.
method Definition and analysis of tensor cumulants to unify and extend previous results.
result Unified explanation of hardness and subexponential-time algorithms for tensor PCA.

We present a voice conversion solution using recurrent sequence to sequence modeling for DNNs. Our solution takes advantage of recent advances in attention based modeling in the fields of Neural Machine Translation (NMT), Text-to-Speech (TTS) and Automatic Speech Recognition (ASR). The problem consists of converting be…

2019-07-15abs ↗pdf ↗

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 ↗

Extracting relevant information from medical conversations and providing it to doctors and patients might help in addressing doctor burnout and patient forgetfulness. In this paper, we focus on extracting the Medication Regimen (dosage and frequency for medications) discussed in a medical conversation. We frame the pro…

2019-12-10abs ↗pdf ↗

This paper explores how LLMs can improve pipeline-based conversational agents.

problem Limitations of pipeline-based conversational agents in human-like conversations.
method Investigated LLMs' capabilities in two phases: design and development, and operations.
result LLMs can enhance pipeline-based agents in various tasks like data generation, intent classification, and auto-correction.