English
Related papers

Related papers: Modeling and Analysing Respondent Driven Sampling …

200 papers

Adaptive sampling algorithms are modern and efficient methods that dynamically adjust the sample size throughout the optimization process. However, they may encounter difficulties in risk-averse settings, particularly due to the challenge…

Optimization and Control · Mathematics 2025-02-17 Sandra Pieraccini , Tommaso Vanzan

The aim of survival analysis in healthcare is to estimate the probability of occurrence of an event, such as a patient's death in an intensive care unit (ICU). Recent developments in deep neural networks (DNNs) for survival analysis show…

One typical assumption in inverse reinforcement learning (IRL) is that human experts act to optimize the expected utility of a stochastic cost with a fixed distribution. This assumption deviates from actual human behaviors under ambiguity.…

Machine Learning · Computer Science 2019-09-25 Rui Chen , Wenshuo Wang , Zirui Zhao , Ding Zhao

Subsampling is commonly used to mitigate costs associated with data acquisition, such as time or energy requirements, motivating the development of algorithms for estimating the fully-sampled signal of interest $x$ from partially observed…

Machine Learning · Computer Science 2025-04-23 Oisin Nolan , Tristan S. W. Stevens , Wessel L. van Nierop , Ruud J. G. van Sloun

In a conventional supervised learning setting, a machine learning model has access to examples of all object classes that are desired to be recognized during the inference stage. This results in a fixed model that lacks the flexibility to…

Computer Vision and Pattern Recognition · Computer Science 2020-01-27 Jathushan Rajasegaran , Munawar Hayat , Salman Khan , Fahad Shahbaz Khan , Ling Shao , Ming-Hsuan Yang

The empirical risk minimization approach to data-driven decision making requires access to training data drawn under the same conditions as those that will be faced when the decision rule is deployed. However, in a number of settings, we…

Methodology · Statistics 2025-09-17 Roshni Sahoo , Lihua Lei , Stefan Wager

The covariate shift is a challenging problem in supervised learning that results from the discrepancy between the training and test distributions. An effective approach which recently drew a considerable attention in the research community…

Machine Learning · Computer Science 2013-11-27 Yun-Qian Miao , Ahmed K. Farahat , Mohamed S. Kamel

In (\cite{zhang2014nonlinear,zhang2014nonlinear2}), we have viewed machine learning as a coding and dimensionality reduction problem, and further proposed a simple unsupervised dimensionality reduction method, entitled deep distributed…

Machine Learning · Computer Science 2015-01-29 Xiao-Lei Zhang

In the time of Big Data, training complex models on large-scale data sets is challenging, making it appealing to reduce data volume for saving computation resources by subsampling. Most previous works in subsampling are weighted methods…

Machine Learning · Computer Science 2021-04-14 Zifeng Wang , Hong Zhu , Zhenhua Dong , Xiuqiang He , Shao-Lun Huang

Confounding is a significant obstacle to unbiased estimation of causal effects from observational data. For settings with high-dimensional covariates -- such as text data, genomics, or the behavioral social sciences -- researchers have…

Artificial Intelligence · Computer Science 2024-02-01 Katherine A. Keith , Sergey Feldman , David Jurgens , Jonathan Bragg , Rohit Bhattacharya

Big Data often presents as massive non-probability samples. Not only is the selection mechanism often unknown, but larger data volume amplifies the relative contribution of selection bias to total error. Existing bias adjustment approaches…

Methodology · Statistics 2022-03-29 Ali Rafei , Carol A. C. Flannagan , Brady T. West , Michael R. Elliott

We propose a function-valued evaluation metric for generative models based on the relative density ratio (RDR) designed to characterize distributional differences between real and generated samples. As an evaluation metric, the RDR function…

Methodology · Statistics 2025-12-29 Yuliang Xu , Yun Wei , Li Ma

General-purpose open-domain dense retrieval systems are usually trained with a large, eclectic mix of corpora and search tasks. How should these diverse corpora and tasks be sampled for training? Conventional approaches sample them…

Information Retrieval · Computer Science 2026-01-30 Meet Doshi , Vishwajeet Kumar , Yulong Li , Jaydeep Sen

In the study of natural and artificial complex systems, responses that are not completely determined by the considered decision variables are commonly modelled probabilistically, resulting in response distributions varying across decision…

Methodology · Statistics 2021-10-07 Athénaïs Gautier , David Ginsbourger , Guillaume Pirot

We propose a relative entropy gradient sampler (REGS) for sampling from unnormalized distributions. REGS is a particle method that seeks a sequence of simple nonlinear transforms iteratively pushing the initial samples from a reference…

Machine Learning · Statistics 2021-10-07 Xingdong Feng , Yuan Gao , Jian Huang , Yuling Jiao , Xu Liu

We introduce data structures for solving robust regression through stochastic gradient descent (SGD) by sampling gradients with probability proportional to their norm, i.e., importance sampling. Although SGD is widely used for large scale…

Machine Learning · Computer Science 2022-07-19 Sepideh Mahabadi , David P. Woodruff , Samson Zhou

Adaptive experiment designs can dramatically improve statistical efficiency in randomized trials, but they also complicate statistical inference. For example, it is now well known that the sample mean is biased in adaptive trials.…

Machine Learning · Statistics 2021-02-16 Vitor Hadad , David A. Hirshberg , Ruohan Zhan , Stefan Wager , Susan Athey

Sampling-based motion planning is a well-established approach in autonomous driving, valued for its modularity and analytical tractability. In complex urban scenarios, however, uniform or heuristic sampling often produces many infeasible or…

Robotics · Computer Science 2026-03-24 Korbinian Moller , Roland Stroop , Mattia Piccinini , Alexander Langmann , Johannes Betz

Determining the precise rank is an important problem in many large-scale applications with matrix data exploiting low-rank plus noise models. In this paper, we suggest a universal approach to rank inference via residual subsampling (RIRS)…

Statistics Theory · Mathematics 2024-11-12 Xiao Han , Qing Yang , Yingying Fan

We consider the transfer of experience samples (i.e., tuples < s, a, s', r >) in reinforcement learning (RL), collected from a set of source tasks to improve the learning process in a given target task. Most of the related approaches focus…

Machine Learning · Computer Science 2018-05-29 Andrea Tirinzoni , Andrea Sessa , Matteo Pirotta , Marcello Restelli
‹ Prev 1 3 4 5 6 7 10 Next ›