% \documentclass{uai2025} % for initial submission
\documentclass[accepted]{uai2025} % after acceptance, for a revised version; 
% also before submission to see how the non-anonymous paper would look like 
                        
%% There is a class option to choose the math font
% \documentclass[mathfont=ptmx]{uai2025} % ptmx math instead of Computer
                                         % Modern (has noticeable issues)
% \documentclass[mathfont=newtx]{uai2025} % newtx fonts (improves upon
                                          % ptmx; less tested, no support)
% NOTE: Only keep *one* line above as appropriate, as it will be replaced
%       automatically for papers to be published. Do not make any other
%       change above this note for an accepted version.

%% Choose your variant of English; be consistent
\usepackage[american]{babel}
% \usepackage[british]{babel}

%% Some suggested packages, as needed:
\usepackage{natbib} % has a nice set of citation styles and commands
    \bibliographystyle{plainnat}
    \renewcommand{\bibsection}{\subsubsection*{References}}
\usepackage{mathtools} % amsmath with fixes and additions
% \usepackage{siunitx} % for proper typesetting of numbers and units
\usepackage{booktabs} % commands to create good-looking tables
\usepackage{tikz} % nice language for creating drawings and diagrams

\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{mathtools}
\usepackage{amsthm}
\usepackage{xspace}
\usepackage{bm}
\usepackage{bbm}
\usepackage{enumitem}
\usepackage{caption}
\captionsetup{skip=4pt}

%% Provided macros
% \smaller: Because the class footnote size is essentially LaTeX's \small,
%           redefining \footnotesize, we provide the original \footnotesize
%           using this macro.
%           (Use only sparingly, e.g., in drawings, as it is quite small.)

%% Self-defined macros
\newcommand{\swap}[3][-]{#3#1#2} % just an example

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}
\newtheorem{assumption}[theorem]{Assumption}
\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\newcommand\snote[2]{{\color{blue!30!red} **{\bf #1:} \texttt{ #2}**}}
\newcommand{\eps}{\varepsilon}
\newcommand{\td}{\tilde{\mathcal{D}}}
\newcommand{\Ex}{\mathbb{E}}
\newcommand{\E}{\mathbb{E}}
\newcommand{\oS}{{\overline{S}}}
\newcommand{\oN}{{\overline{N}}}
\newcommand{\oQ}{\overline{Q}}
\newcommand{\done}{{\mathcal{D}_1}}
\newcommand{\dzero}{{\mathcal{D}_0}}
\newcommand{\Langle}{\left\langle}
\newcommand{\Rangle}{\right\rangle}
\newcommand{\cH}{\mathcal{H}}
\newcommand{\mT}{\mathfrak{T}}
\newcommand{\Var}{\operatorname{Var}}
\newcommand{\Cov}{\operatorname{Cov}}
\newcommand{\trc}{{\sf{trunc}}}
\newcommand{\pos}{{\sf{pos}}}
\newcommand{\opt}{{\sf{opt}}}
\newcommand{\val}{{\sf{val}}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\Z}{\mathbb{Z}}

\newcommand{\mc}[1]{\ensuremath{\mathcal{#1}}\xspace}
\newcommand{\mb}[1]{\ensuremath{\mathbf{#1}}\xspace}
\newcommand{\tn}[1]{\ensuremath{\textnormal{#1}}\xspace}
\newcommand{\ol}[1]{\ensuremath{\overline{#1}}\xspace}
\newcommand{\wh}[1]{\ensuremath{\widehat{#1}}\xspace}

\DeclareMathAlphabet\mathbfcal{OMS}{cmsy}{b}{n}

\newcommand{\mbc}[1]{\ensuremath{\mathbfcal{#1}}\xspace}



\newcommand{\bX}{{\mb{X}}}
\newcommand{\bY}{{\mb{Y}}}
\newcommand{\bc}{{\mb{c}}}
\newcommand{\bZ}{{\mb{Z}}}
\newcommand{\bA}{{\mb{A}}}
\newcommand{\ba}{{\mb{a}}}
\newcommand{\bB}{{\mb{B}}}
\newcommand{\bb}{{\mb{b}}}
\newcommand{\bW}{{\mb{W}}}
\newcommand{\bU}{{\mb{U}}}
\newcommand{\bV}{{\mb{V}}}

\newcommand{\bg}{{\mb{g}}}
\newcommand{\bx}{{\mathbf{x}}}
\newcommand{\by}{{\mathbf{y}}}
\newcommand{\bL}{{\mathbf{L}}}
\newcommand{\bT}{{\mathbf{T}}}
\newcommand{\bs}{{\mathbf{s}}}
\newcommand{\bz}{{\mathbf{z}}}
\newcommand{\bu}{{\mathbf{u}}}
\newcommand{\bv}{{\mathbf{v}}}
\newcommand{\bw}{{\mathbf{w}}}
\newcommand{\br}{{\mathbf{r}}}
% \newcommand{\bs}{{\mathbf{s}}}
\newcommand{\bS}{{\mathbf{S}}}
\newcommand{\bG}{{\mathbf{G}}}
\newcommand{\bH}{{\mathbf{H}}}
\newcommand{\bD}{{\mathbf{D}}}

\newcommand{\pacmir}{{\sc PAC-MIR}\xspace}
\newcommand{\exactmir}{{\sc EXACT-MIR}\xspace}

\usepackage[ruled,vlined]{algorithm2e}

\title{Learning Algorithms for Multiple Instance Regression}

% The standard author block has changed for UAI 2025 to provide
% more space for long author lists and allow for complex affiliations
%
% All author information is authomatically removed by the class for the
% anonymous submission version of your paper, so you can already add your
% information below.
%
% Add authors
\author[1]{\href{mailto:<aaryangupta@google.com>?Subject=Learning Algorithms for Multiple Instance Regression}{Aaryan~Gupta}{}}
\author[1]{\href{mailto:<rishisaket@google.com>?Subject=Learning Algorithms for Multiple Instance Regression}{Rishi~Saket}{}}
% Add affiliations after the authors
\affil[1]{%
    Google DeepMind \\ \texttt{\small \{aaryangupta,rishisaket\}@google.com}
}
  
  \begin{document}
\maketitle

\begin{abstract}
  Multiple instance regression, introduced by Ray and Page [2001], is a generalisation of supervised regression  in which the training data is available as a bag of feature-vectors (instances) and for each bag there is a bag-label which matches the label of one (unknown) primary instance from that bag. The goal is to compute a hypothesis regressor consistent with the underlying instance-labels. While most works on MIR focused on training models on such training data, computational learnability of MIR was only recently explored by Chauhan et al. [UAI 2024] who showed worst case intractability of properly learning \textit{linear regressors} in MIR by showing a inapproximability bound. However, their work did not rule out efficient algorithms for this problem on natural distributions and randomly chosen labels. 
%   We show surprisingly that \textit{linear regressors} can be efficiently learnt exactly i.e., \emph{without any error}, in MIR when given access to random bags of uniformly randomly sampled primary instance chosen as the bag-label in which the feature vectors are independently sampled from sub-Gaussian distributions. This is achieved by optimizing a certain bag-level loss which yields the target linear regressor exactly, while the sample-size is only to ensure,  via concentration bounds, a non-degenerate convex system. We generalize this further to \textit{linear regressors} in MIR with a non-decreasing monotonic activation layer (such as ReLU) in the same setting. Lastly, we show that the bag-level loss is also useful for learning general concepts (e.g. neural networks) in this setting: an optimizer of the loss on sampled bags is, w.h.p. a close approximation of a scaled version of the target function. We include experimental evaluations of our learning algorithms showing that our method outperforms the baseline MIR methods.
In this work we show that it is indeed possible to efficiently learn linear regressors in MIR when given access to random bags of uniformly randomly sampled primary instance chosen as the bag-label in which the feature vectors are independently sampled from Gaussian distributions. This is achieved by optimizing a certain bag-level loss which, via concentration bounds, yields a close approximation to the target linear regressor. Lastly, we show that the bag-level loss is also useful for learning general concepts (e.g. neural networks) in this setting: an optimizer of the loss on sampled bags is, w.h.p. a close approximation of a scaled version of the target function. We include experimental evaluations of our learning algorithms on synthetic and real-world datasets showing that our method outperforms the baseline MIR methods.
\end{abstract}

\input{introduction}

\input{previous_work}

\input{problem_defn_our_results}

\input{techniques}

\input{preliminaries}

\input{linear}

\input{neuralproof}

\input{experiments}



% \begin{contributions} % will be removed in pdf for initial submission 
% 					  % (without ‘accepted’ option in \documentclass)
%                       % so you can already fill it to test with the
%                       % ‘accepted’ class option
%     Briefly list author contributions. 
%     This is a nice way of making clear who did what and to give proper credit.
%     This section is optional.

%     H.~Q.~Bovik conceived the idea and wrote the paper.
%     Coauthor One created the code.
%     Coauthor Two created the figures.
% \end{contributions}

% \begin{acknowledgements} % will be removed in pdf for initial submission,
% 						 % (without ‘accepted’ option in \documentclass)
%                          % so you can already fill it to test with the
%                          % ‘accepted’ class option
%     Briefly acknowledge people and organizations here.

%     \emph{All} acknowledgements go in this section.
% \end{acknowledgements}

% References
\bibliography{uai2025-template}

\newpage

\onecolumn

% \title{Learning Algorithms for Multiple Instance Regression\\(Supplementary Material)}
% \maketitle

\appendix
% \input{uai2025-template/appendix}
\input{uai2025-template/appendix}


\end{document}
