Unified framework for binary responses using AUC loss and low-rank constraint.
problem Statistical inefficiency and shared structure in fitting multiple binary responses.
method Pairwise AUC loss aggregation with low-rank constraint, scalable projected gradient descent.
result Unified framework outperforms likelihood-based approaches in challenging settings.
Enhances preference learning by incorporating response times into binary choices.
problem Limited information from binary choices about preference strength.
method Combines choices and response times using the EZ diffusion model.
result Response times improve utility estimation for strong preferences.
Proposes MELODIC family for simultaneous binary logistic regression.
problem Simultaneous analysis of multiple binary response variables.
method Defines models in a reduced Euclidean space using a distance rule.
result Improves predictive accuracy through model interdependence.
POTD estimates SDR subspace using optimal transport for binary response.
problem Insufficient performance of existing SDR methods for categorical responses.
method Principal optimal transport direction (POTD) using optimal transport coupling.
result POTD exclusively estimates SDR subspace for error-free class labels.
Optimal ability estimation in adaptive testing with binary responses.
problem Estimating a continuous ability parameter from sequential binary responses.
method Adaptive selection of questions to maximize Fisher information, updating estimate using method-of-moments, and deciding accuracy with a test statistic.
result Fisher-tracking strategy achieves optimal performance in fixed-confidence and fixed-budget regimes.
New method for estimating gradients in stochastic binary networks.
problem Challenges in training neural networks with binary activations and weights.
method Combines sampling and analytic approximation steps to estimate gradients accurately.
result Significantly reduced variance at the cost of small bias, leading to practical tradeoffs.
Reduces bounded loss learning to binary classification.
problem Universal consistency of non-i.i.d. processes with bounded loss.
method Constructive reduction to binary classification.
result Any bounded loss output setting can be reduced to binary classification.
Two novel methods estimate multiple FDR directions for binary categorical responses.
problem Estimating multiple FDR directions for categorical responses.
method Information maximization and square loss mutual information.
result Statistical consistency of the proposed methods established.
GPIRT uses Gaussian processes to estimate latent traits and IRFs from binary responses.
problem Nonparametric IRT models struggle to estimate flexible IRFs and latent traits simultaneously.
method GPIRT employs Gaussian process priors to relax IRF assumptions while estimating latent traits.
result GPIRT provides a flexible solution to IRT challenges, including active learning.
The paper enhances preference learning by incorporating response time data.
problem Lack of temporal information in user decision-making for reward model learning.
method Integrates response time alongside binary choice data using the EZ model and Neyman-orthogonal loss functions.
result Response time-augmented approach reduces error rates from exponential to polynomial scaling, improving sample efficiency.
BELIEF framework interprets GLMs using binary linear models.
problem Understanding and interpreting generalized linear models (GLMs) with binary outcomes.
method Developed a framework called binary expansion linear effect (BELIEF) to interpret GLMs through transparent linear models.
result BELIEF framework reveals perfect predictors in complete separation scenarios.
Gonogo offers tools for sensitivity experiments in R.
problem Conducting, analyzing, and simulating sensitivity experiments.
method Suite of R functions for various adaptive procedures.
result Achieving overlapping data and refining testing in distribution tails.
Binary feedback outperforms ordinal comparisons in ranking recovery.
problem Challenges the conventional wisdom that ordinal comparisons offer richer information.
method Proposes a parametric framework for modeling ordinal paired comparisons, binarizing ordinal data, and proving faster convergence rates for binary comparisons.
result Binarizing ordinal data significantly improves ranking recovery accuracy and exhibits a substantial performance gap.
Study on recovering sparse linear classifiers from mixed binary responses.
problem Learning a mixture of sparse linear classifiers from binary responses.
method Query-based approach to identify all sparse vectors from a set.
result Upper bounds on the number of queries required for recovery.
Most binary classifiers work by processing the input to produce a scalar response and comparing it to a threshold value. The various measures of classifier performance assume, explicitly or implicitly, probability distributions Ps and Pn of the response belonging to either class, probability distributions for the…
We consider sequential decision making problems for binary classification scenario in which the learner takes an active role in repeatedly selecting samples from the action pool and receives the binary label of the selected alternatives. Our problem is motivated by applications where observations are time consuming and…
BART is extended to handle various response variables.
problem Modeling nonlinear regression functions for diverse response types.
method Generalized Bayesian Additive Regression Trees (GBART) for exponential family distributions.
result The posterior concentrates at a minimax rate for certain response distributions.
Kriging is an efficient machine-learning tool, which allows to obtain an approximate response of an investigated phenomenon on the whole parametric space. Adaptive schemes provide a the ability to guide the experiment yielding new sample point positions to enrich the metamodel. Herein a novel adaptive scheme called Mon…
We study contextual search, a generalization of binary search in higher dimensions, which captures settings such as feature-based dynamic pricing. Standard formulations of this problem assume that agents act in accordance with a specific homogeneous response model. In practice, however, some responses may be adversaria…
This paper presents Sparse Partitioning, a Bayesian method for identifying predictors that either individually or in combination with others affect a response variable. The method is designed for regression problems involving binary or tertiary predictors and allows the number of predictors to exceed the size of the sa…
We consider selection of random predictors for high-dimensional regression problem with binary response for a general loss function. Important special case is when the binary model is semiparametric and the response function is misspecified under parametric model fit. Selection for such a scenario aims at recovering th…
Proposes an L1-regularized functional SVM for binary classification with functional covariates.
problem Binary classification with multivariate functional covariates.
method L1-regularized functional support vector machine (SVM) with an accompanying algorithm.
result The proposed classifier performs well in prediction and feature selection.
Algorithm solves online binary classification and infinite games using ERM oracle.
problem Online learning and solving infinite games with computationally inefficient oracles.
method Proposes an algorithm relying solely on ERM oracle calls for online binary classification and nonparametric games.
result Achieves finite and sublinearly growing regret in various settings.
Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.
problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.
Bayesian method models binary response and covariates for two groups, estimating causal relationships.
problem Estimating causal relationships between binary response and covariates in observational data.
method Gaussian DAG-probit model with MCMC sampling for posterior distribution estimation.
result Validated method on simulated and real datasets, showing value of grouping variable in causality.
New Bayesian method for sparse multidimensional item response theory.
problem Sparse interpretable explanations for questionnaire data.
method Bayesian EM algorithm for sparse factor loadings.
result Reliable recovery of factor dimensionality and latent structure.
The paper develops efficient estimators for semi-parametric binary models in distributed computing.
problem Estimation and inference challenges in large-scale data under non-smooth objective functions.
method Proposes one-shot and multi-round divide-and-conquer estimators with adaptive kernel smoothing to relax constraints and achieve superlinear optimization error.
result Establishes quadratic convergence up to optimal statistical error rate and handles dataset heterogeneity and high-dimensional sparse parameters.
The paper proposes a new method for learning reward models from ordinal feedback, improving upon binary feedback.
problem Learning reward models from human preferences using binary feedback discards useful samples and loses fine-grained information.
method The paper introduces a framework for learning reward models under ordinal feedback, generalizing the Bradley-Terry model.
result Ordinal feedback reduces the Rademacher complexity compared to binary feedback, leading to better reward learning.
Archetypal analysis is an exploratory tool that explains a set of observations as mixtures of pure (extreme) patterns. If the patterns are actual observations of the sample, we refer to them as archetypoids. For the first time, we propose to use archetypoid analysis for binary observations. This tool can contribute to …
New methods protect privacy while providing accurate prediction sets.
problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.
New method predicts binary matrix entries using empirical Bayes and low-rank structure.
problem Predicting unobserved entries in binary matrices.
method Empirical Bayes method motivated by Efron--Morris estimator, exploiting low-rank structure.
result Superior performance in predictive accuracy, calibration, and efficiency compared to existing methods.
Efficient methods estimate concordance probability for big data.
problem Efficiently calculating concordance probability in large datasets.
method Proposes two estimation methods for discrete and continuous settings.
result Estimators are accurate and computationally efficient.
New method for estimating spatial associations with discrete data, even under model misspecification.
problem Estimating associations between covariates and discrete responses with spatial variability and nonrandom sampling.
method Proposes a novel approach to handle spatially varying noise, provides a proof of consistency, and uses a delta method argument.
result Empirically shows reliable confidence intervals compared to standard methods, even with model misspecification.
Non-negative matrix factorization models based on a hierarchical Gamma-Poisson structure capture user and item behavior effectively in extremely sparse data sets, making them the ideal choice for collaborative filtering applications. Hierarchical Poisson factorization (HPF) in particular has proved successful for scala…
The F-measure, which has originally been introduced in information retrieval, is nowadays routinely used as a performance metric for problems such as binary classification, multi-label classification, and structured output prediction. Optimizing this measure is a statistically and computationally challenging problem, s…
Transformers are explained as infinite-dimensional kernel machines.
problem Understanding the mechanics of Transformers in AI.
method Characterized Transformers' attention mechanism as a kernel learning method on Banach spaces.
result Transformer's kernel has infinite feature dimension and can learn any binary non-Mercer reproducing kernel Banach space pair.
A new model for latent class analysis with weighted responses.
problem Limitation of latent class model for real-world data with continuous or negative responses.
method Proposed a novel generative model, the weighted latent class model (WLCM).
result The proposed WLCM is more realistic and general than the latent class model.
New method for efficient maximum likelihood estimation of p-generalized probit regression.
problem Efficient estimation of p-generalized probit regression models. method Combining sketching techniques with importance subsampling to obtain a coreset.
result Maximum likelihood estimator can be approximated efficiently up to a factor of (1+ε) on large data. The study simplifies assessing overlap in logistic regression models using empirical likelihood.
problem Assessing overlap in multidimensional logistic regression models.
method Translation of Silvapulle's condition to empirical likelihood maximization, mechanized with R code.
result Minimal overlapping structures are cataloged in dimensions less than four, providing rules for higher dimensions.
Machine learning classifies gravitational wave signals to test General Relativity.
problem Testing General Relativity with gravitational wave signals from binary black hole mergers.
method Convolutional Neural Networks (CNNs) trained on whitened waveforms and response function type observables.
result CNNs improve classification sensitivity by a factor of approximately 33 compared to whitened waveforms.
Identity-link IRT improves TVD-MI scores without curvature violations.
problem Preserving additivity in TVD-MI scores for efficient LLM evaluation.
method Derives clipped-linear model from Gini entropy maximization, using identity link.
result Identity-link yields lower curvature violations (median curl 0.080-0.150) compared to probit/logit.
We study the query complexity of a learner-private sequential learning problem, motivated by the privacy and security concerns due to eavesdropping that arise in practical applications such as pricing and Federated Learning. A learner tries to estimate an unknown scalar value, by sequentially querying an external datab…
ContiVAE estimates individual dose-response curves from unobserved confounders using observational data.
problem Estimating causal effects of continuous treatments considering unobserved confounders.
method Variational auto-encoder with a Tilted Gaussian prior distribution modeling hidden confounders as latent variables.
result ContiVAE outperforms existing methods by up to 62% in predicting individual dose-response curves.
Wisdom of the crowd, the collective intelligence derived from responses of multiple human or machine individuals to the same questions, can be more accurate than each individual, and improve social decision-making and prediction accuracy. This can also integrate multiple programs or datasets, each as an individual, for…
Study develops efficient algorithm for probabilistic penetration response of composite plates.
problem Probabilistic modeling of discrete structural response, focusing on binary events like buckling.
method Adaptive domain-based decomposition, sparse grid sampling, assumption of monotonic behavior.
result Efficient computational framework for probabilistic penetration response of composite plates.
DisCoveR efficiently discovers declarative process models from event logs.
problem Mining declarative process models from event logs efficiently and accurately.
method DisCoveR precisely formalizes an algorithm, uses a bit vector implementation, and rigorously evaluates performance.
result DisCoveR outperforms other declarative miners in accuracy and runtime.
Bayesian method predicts runtime metrics for fog manufacturing.
problem Accurate prediction of runtime performance metrics in fog manufacturing.
method Bayesian sparse regression for multivariate mixed responses.
result Enhanced prediction and statistical inferences of runtime metrics.
Novel Bayesian model improves EEG-based BCI character selection.
problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.