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

2.8%5.5%8.3%11.0% · Nov 201819922001200920182026
48 results for classifier conversion

The fashion industry is establishing its presence on a number of visual-centric social media like Instagram. This creates an interesting clash as fashion brands that have traditionally practiced highly creative and editorialized image marketing now have to engage with people on the platform that epitomizes impromptu, r…

2017-04-13abs ↗pdf ↗

To identify and classify toxic online commentary, the modern tools of data science transform raw text into key features from which either thresholding or learning algorithms can make predictions for monitoring offensive conversations. We systematically evaluate 62 classifiers representing 19 major algorithmic families …

2018-10-03abs ↗pdf ↗

Study optimizes classifiers for credit card mail campaigns and default prediction.

problem Optimizing classifiers for credit card mail campaigns and default prediction.
method Three distinct models: response, risk, and response-risk. Optimized various performance metrics.
result Random Forest classifier achieves highest accuracy (83.2%) in multi-class response-risk model.

We classify Veech groups of tame non-compact flat surfaces. In particular we prove that all countable subgroups of GL+(2,R)\mathbf{GL}_+(2,\R) avoiding the set of mappings of norm less than 1 appear as Veech groups of tame non-compact flat surfaces which are Loch Ness monsters. Conversely, a Veech group of any tame flat surf…

2009-06-29abs ↗pdf ↗

The paper classifies surfaces with constant skew curvature in 3-space forms.

problem Classifying surfaces with constant skew curvature in 3-space forms.
method Variational characterization and flow of binormal vector field.
result Classification of rotational surfaces with constant skew curvature.

Paper improves conversion prediction models for online advertising.

problem Predicting different types of conversions in online advertising.
method Multi-Task Learning with MT-FwFM.
result Improved AUC by 0.74% and 0.84% on two conversion types, and overall AUC by 0.50%.

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.

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.

Framework converts singer identity and vocal technique from non-parallel corpora.

problem Converts singer identity and vocal technique from non-parallel corpora.
method Uses variational autoencoders with separate encoders for singer identity and vocal technique.
result Successfully disentangles and converts singer identity and vocal technique.

Conversational UCB accelerates bandit learning with user feedback.

problem Slow learning speed in traditional contextual bandit algorithms.
method Generalized contextual bandit to conversational contextual bandit, leveraging both behavioral and conversational feedbacks.
result ConUCB achieves a smaller regret upper bound, indicating faster learning speed.

Automated system extracts medication regimens from medical conversations.

problem Extract relevant medication information from medical conversations.
method QA task approach, combined QA and Information Extraction, data augmentation, public embeddings, pretraining.
result Improved accuracy in extracting dosage and frequency from 54.28 and 37.13 to 89.57 and 45.94.

We give an algebraic definition of a Markowitz market and classify markets up to isomorphism. Given this classification, the theory of portfolio optimization in Markowitz markets without short selling constraints becomes trivial. Conversely, this classification shows that, up to isomorphism, there is little that can be…

2016-11-23abs ↗pdf ↗

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.

Solution for voice conversion with limited data using hierarchical seq2seq and attention models.

problem Voice conversion between speakers with limited parallel audio pairs.
method Hierarchical sequence to sequence model with attention-based decoder, trained on single speaker dataset.
result Improved voice conversion quality using mel spectrograms and wavenet vocoder.

The paper explores fair regression and classification under demographic parity constraints.

problem Ensuring fairness in regression and classification models under demographic parity constraints.
method Characterizes the optimal fair regression function using a barycenter problem with optimal transport costs and studies the connection between fair classification and regression.
result The optimal fair regression function is derived from the solution to a barycenter problem with optimal transport costs, and the optimal fair cost-sensitive classifiers can be derived by applying thresholds to this function.

Classifies uncolored bonded knots with up to 7 singularity points.

problem Classifying uncolored bonded knots with up to 7 singularity points.
method Generation of planar graphs, conversion into bonded knot diagrams, use of Yamada polynomial, and brute-force Reidemeister moves.
result Systematic classification of uncolored bonded knots with singularity number at most seven.

Study proposes a time-aware model to predict user conversion intent.

problem Weak predictive signals from users not suitable for conversion prediction.
method Time-aware approach to model user activities and capture conversion intent signals.
result Approach outperforms other models on real-world datasets.

Improved SAR in asynchronous conversations using neural models and unlabeled data.

problem Lack of labeled data for SAR in asynchronous conversations.
method Hierarchical LSTM-CRF model, semi-supervised learning with word embeddings, adversarial training.
result Adversarial training improves SAR performance by leveraging labeled data from synchronous domains.

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.

ConvS2S-VC converts voice characteristics and pitch contour using a fully convolutional seq2seq model.

problem Voice conversion with preservation of pitch contour and duration.
method Fully convolutional seq2seq architecture with conditional batch normalization.
result ConvS2S-VC outperforms baseline methods in sound quality and speaker similarity.

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.

A method corrects feedback shift in predicting conversion rates with delayed feedback.

problem Delayed feedback leads to mislabeling of positive instances in training data.
method Uses importance weight approach to correct feedback shift.
result Proposed method outperforms existing methods in offline and online experiments.

Level assessment for foreign language students is necessary for putting them in the right level group, furthermore, interviewing students is a very time-consuming task, so we propose to automate the evaluation of speaker fluency level by implementing machine learning techniques. This work presents an audio processing s…

2018-08-31abs ↗pdf ↗