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

4198381,2561,675 · Jun 202019922001200920172026
48 results for multiple choice learning

rMCL improves on MCL by preserving diversity in predictions for regression problems.

problem Multimodal density estimation in regression settings with multiple targets.
method rMCL uses a learned scoring scheme based on Voronoi tessellations to maintain diversity among predictions.
result rMCL outperforms existing MCL variants in sound source localization tasks.

Ensemble methods are arguably the most trustworthy techniques for boosting the performance of machine learning models. Popular independent ensembles (IE) relying on naive averaging/voting scheme have been of typical choice for most applications involving deep neural networks, but they do not consider advanced collabora…

2017-06-12abs ↗pdf ↗

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

aMCL uses annealing to improve hypothesis diversity in ambiguous tasks.

problem Limitations of Winner-takes-all in predicting plausible hypotheses.
method Combines simulated annealing with Multiple Choice Learning (MCL).
result Enhanced exploration of hypothesis space during training.

LoRA-MCL improves language models by generating diverse sentence continuations.

problem Language models struggle with generating diverse, plausible sentence continuations.
method Low-Rank Adaptation combined with Multiple Choice Learning (MCL) to handle ambiguity.
result LoRA-MCL generates high-diversity and relevant outputs in various tasks.

In this paper, we propose an active learning algorithm and models which can gradually learn individual's preference through pairwise comparisons. The active learning scheme aims at finding individual's most preferred choice with minimized number of pairwise comparisons. The pairwise comparisons are encoded into probabi…

2018-05-04abs ↗pdf ↗

We present a novel method for obtaining high-quality, domain-targeted multiple choice questions from crowd workers. Generating these questions can be difficult without trading away originality, relevance or diversity in the answer options. Our method addresses these problems by leveraging a large corpus of domain-speci…

2017-07-19abs ↗pdf ↗

Model improves BERT for answering multiple-choice questions in large texts.

problem Improving machine comprehension of large text corpora for question answering.
method Developed a model using BERT with a semantic similarity attention layer to extract key sentences.
result Outperforms leading models in MovieQA challenge with 87.79% test accuracy.

This paper tackles the problem of selecting among several linear estimators in non-parametric regression; this includes model selection for linear regression, the choice of a regularization parameter in kernel ridge regression, spline smoothing or locally weighted regression, and the choice of a kernel in multiple kern…

2009-09-10abs ↗pdf ↗

Simplified feature selection using a single agent with restructured choice strategy.

problem Efficiency and cost issues in multi-agent reinforced feature selection.
method Single-agent approach with restructured choice strategy, including scanning method, feature prioritization, state representation, and reward scheme.
result Improved efficiency and effectiveness of feature selection.

In discrete choice modeling (DCM), model misspecifications may lead to limited predictability and biased parameter estimates. In this paper, we propose a new approach for estimating choice models in which we divide the systematic part of the utility specification into (i) a knowledge-driven part, and (ii) a data-driven…

2018-12-23abs ↗pdf ↗

Recent character and phoneme-based parametric TTS systems using deep learning have shown strong performance in natural speech generation. However, the choice between character or phoneme input can create serious limitations for practical deployment, as direct control of pronunciation is crucial in certain cases. We dem…

2018-11-17abs ↗pdf ↗

New method quantifies uncertainty in fine-tuned LLMs using LoRA ensembles.

problem Uncertainty in fine-tuned LLMs and how to trust their predictions.
method Posterior approximations using low-rank adaptation ensembles.
result Unexpected retention of acquired knowledge during fine-tuning in overfitting regime.

This paper presents the current state of a work in progress, whose objective is to better understand the effects of factors that significantly influence the performance of Latent Semantic Analysis (LSA). A difficult task, which consists in answering (French) biology Multiple Choice Questions, is used to test the semant…

2008-11-02abs ↗pdf ↗

We propose a generic model for multiple choice situations in the presence of herding and compare it with recent empirical results from a Web-based music market experiment. The model predicts a phase transition between a weak imitation phase and a strong imitation, `fashion' phase, where choices are driven by peer press…

2006-06-26abs ↗pdf ↗

Paper tackles RLHF with DCPPO method, proving near-optimal suboptimality.

problem Challenges in offline RLHF with limited human feedback and bounded rationality.
method DCPPO method involving three stages: MLE, reward function recovery, and pessimistic value iteration.
result DCPPO's suboptimality almost matches classical pessimistic offline RL in terms of distribution shift and dimension.

The paper classifies symmetric triads with multiplicities and their applications.

problem Classifying symmetric triads with multiplicities and their applications.
method Developed the theory of symmetric triads with multiplicities, classified abstract triads, and determined corresponding triads for commutative compact triads.
result Classified symmetric triads with multiplicities and their applications.

This work uses conformal prediction to quantify uncertainty in large language models for multiple-choice questions.

problem Ensuring robustness and reliability of large language models in high-stakes applications.
method Conformal prediction applied to multi-choice question answering.
result Uncertainty estimates from conformal prediction are closely related to prediction accuracy.

Consensus dimension reduction combines multiple visualizations to identify shared patterns.

problem Conflicting visualizations from different dimension reduction methods.
method Multi-view learning to identify stable patterns across multiple views.
result Consensus visualization effectively identifies shared low-dimensional data structure.

PVI combines federated learning and variational inference for probabilistic model training.

problem Federated learning's lack of probabilistic model uncertainty estimation.
method Partitioned variational inference (PVI) framework for federated probabilistic model training.
result PVI unifies fragmented literature and demonstrates effectiveness in various federated settings.

We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …

2011-10-17abs ↗pdf ↗

Optimizes control of hybrid systems with multiple switching processes.

problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.

New method uses multiple kernels to improve SVGD performance.

problem Sub-optimal performance of single kernel in SVGD.
method Combines multiple kernels to approximate optimal kernel, using Kernelized Stein Discrepancy (KSD) and constructing Multiple Kernel SVGD (MK-SVGD).
result Consistently matches or outperforms competing methods in experiments.

Novel optimization method detects change points in Gaussian data.

problem Detecting change points in univariate Gaussian data sequences.
method Continuous optimization for best subset selection (COMBSS) applied to a reformulated statistical inverse problem.
result Adaptation and evaluation of COMBSS for offline normal mean multiple change-point detection.

Tutorials on preference learning with Gaussian Processes.

problem Understanding individual preferences and choices for efficient and personalized applications.
method Presentation of a comprehensive framework for preference learning with Gaussian Processes, incorporating rationality principles.
result Construction of preference learning models that encompass various utility models and scenarios.

The paper studies how regularization parameters affect sparsity in deep neural networks.

problem Reducing the complexity of deep neural networks by promoting sparsity.
method Derives 1\ell_1-norm sparsity-promoting models, characterizes sparsity levels, and develops algorithms for selecting optimal regularization parameters.
result Developed algorithms to select regularization parameters for desired sparsity levels in neural networks.

New model reveals significant impact of data and parameter variations on machine learning benchmarks.

problem Variance in machine learning benchmarks due to data sampling, initialization, and hyperparameters.
method Modeling the benchmarking process, analyzing comparison methods, and studying error rates.
result Adding more sources of variation reduces compute cost while improving performance.

The data scarcity of user preferences and the cold-start problem often appear in real-world applications and limit the recommendation accuracy of collaborative filtering strategies. Leveraging the selections of social friends and foes can efficiently face both problems. In this study, we propose a strategy that perform…

2019-05-31abs ↗pdf ↗

The Rashomon effect shows many models can perform similarly, explored in this paper.

problem Why do many models perform similarly in machine learning?
method Categorized causes into statistical, structural, and procedural sources.
result Structural multiplicity persists and cannot be resolved without additional assumptions.

Learning linear combinations of multiple kernels is an appealing strategy when the right choice of features is unknown. Previous approaches to multiple kernel learning (MKL) promote sparse kernel combinations to support interpretability and scalability. Unfortunately, this 1-norm MKL is rarely observed to outperform tr…

2010-02-27abs ↗pdf ↗

Active learning method for ABC statistics selection reduces expert work and improves posterior estimates.

problem Handling intractable likelihood functions in models with domain knowledge.
method Active learning method for selecting summary statistics in ABC.
result Better posterior estimates than existing methods, especially with limited simulation budget.

Develops UKP for comparing feature representations in multitask learning.

problem Comparing feature representations learned by different models without access to test data.
method Uniform Kernel Prober (UKP) for comparing representations in kernel ridge regression tasks.
result UKP provides a uniform measure of prediction error on test data without access to test data.

Oja's algorithm has been the cornerstone of streaming methods in Principal Component Analysis (PCA) since it was first proposed in 1982. However, Oja's algorithm does not have a standardized choice of learning rate (step size) that both performs well in practice and truly conforms to the online streaming setting. In th…

2019-05-28abs ↗pdf ↗

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 ↗

Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses space and the regularization functional through the notion of reproducing kernel Hilbert spaces. F…

2011-06-30abs ↗pdf ↗

Missing data is a significant problem impacting all domains. State-of-the-art framework for minimizing missing data bias is multiple imputation, for which the choice of an imputation model remains nontrivial. We propose a multiple imputation model based on overcomplete deep denoising autoencoders. Our proposed model is…

2017-05-08abs ↗pdf ↗