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

Trend · papers per month

6121824 · May 202619922001200920172026
48 results for analog-to-digital conversion

Algorithm recovers spike direction from modulo-reduced measurements in high dimensions.

problem Recovering spike direction from modulo-reduced measurements in high-dimensional space.
method Developed an algorithm for estimating the spike direction using modulo-reduced measurements.
result Algorithm accurately estimates the spike direction with n=poly(k)n=\mathrm{poly}(k) measurements when ΔlogkΔ\gtrsim \sqrt{\log k}.

Study identifies three quantization regimes for ReLU networks.

problem Approximation of Lipschitz functions by ReLU networks with finite-precision weights.
method Established through nonasymptotic tight lower and upper bounds on minimax approximation error.
result Memory-optimality achieved in proper quantization regime for deep networks.

This paper introduces GLT for better input data representation in BNN and proposes a compact topology with block pruning.

problem Improving input data representation for Binary Neural Networks (BNN).
method Generic Learned Thermometer (GLT) for encoding, block pruning and Knowledge Distillation for compact topology.
result Significant accuracy gains and lightweight fully-binarized models with limited accuracy degradation.

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.

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 ↗

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.

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.

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.

Unified approach for conversational recommendation by integrating attributes and items.

problem Cold-start users' real-time personalization in online recommendation.
method Seamlessly unifies attributes and items in Thompson Sampling framework for interactive decision-making.
result Conversational Thompson Sampling (ConTS) outperforms existing methods in success rate and conversation turns.

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.

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.

Deep learning improves conversational recommender systems.

problem Creating effective goal-oriented dialogue systems through natural language interactions.
method Apply deep learning techniques to conversational recommender systems.
result Deep learning models enhance user preference learning in CRS.

In this work we explored building automatic speech recognition models for transcribing doctor patient conversation. We collected a large scale dataset of clinical conversations (14,00014,000 hr), designed the task to represent the real word scenario, and explored several alignment approaches to iteratively improve data qua…

2017-11-20abs ↗pdf ↗

In this paper we propose a multi-state model for the evaluation of the conversion option contract. The multi-state model is based on age-indexed semi-Markov chains that are able to reproduce many important aspects that influence the valuation of the option such as the duration problem, the time non-homogeneity and the …

2017-07-03abs ↗pdf ↗

MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.

problem Solving math problems expressed in natural language.
method MathChat is a conversational framework combining an LLM agent and a user proxy agent for collaborative problem-solving.
result MathChat improves tool-using prompting methods by 6% on difficult math problems.

In this work we introduce a semi-supervised approach to the voice conversion problem, in which speech from a source speaker is converted into speech of a target speaker. The proposed method makes use of both parallel and non-parallel utterances from the source and target simultaneously during training. This approach ca…

2019-09-30abs ↗pdf ↗

This paper develops a new deep neural network optimized equalization framework for massive multiple input multiple output orthogonal frequency division multiplexing (MIMOOFDM) systems that employ low-resolution analog-to-digital converters (ADCs) at the base station (BS). The use of lowresolution ADCs could largely red…

2019-05-14abs ↗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.

Let h:XYh:X \to Y be a homeomorphism between hyperbolic surfaces with finite topology. If hh is homotopic to a holomorphic map, then every closed geodesic in XX is at least as long as the corresponding geodesic in YY, by the Schwarz Lemma. The converse holds trivially when XX and YY are disks or annuli, and it holds…

2014-11-21abs ↗pdf ↗

This paper recovers smooth functions from noisy modulo samples using a three-stage strategy.

problem Recovering Hölder smooth functions from noisy modulo samples.
method Three-stage strategy: denoising with local polynomial estimators, unwrapping, and spline-based quasi-interpolant.
result Uniform error rates for Hölder class functions with high probability.

Group discussions are essential for organizing every aspect of modern life, from faculty meetings to senate debates, from grant review panels to papal conclaves. While costly in terms of time and organization effort, group discussions are commonly seen as a way of reaching better decisions compared to solutions that do…

2016-04-25abs ↗pdf ↗

New algorithm speeds up user preference learning in conversational contexts.

problem Limited performance of existing conversational contextual bandit approaches.
method Proposes ConLinUCB framework and two algorithms, ConLinUCB-BS and ConLinUCB-MCR, with explorative key-term selection.
result Proves tighter regret bounds and achieves significant computational efficiency improvements.

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 ↗