%\VignetteIndexEntry{GIR: Estimation, inference and prediction} %\VignetteEncoding{UTF-8} \documentclass[11pt]{article} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{lmodern} \usepackage{Sweave} \SweaveOpts{concordance=TRUE} \usepackage[a4paper,margin=2.3cm]{geometry} \usepackage{amsmath,amssymb,mathtools} \usepackage{booktabs,longtable,array,tabularx} \usepackage{enumitem} \usepackage{xcolor} \usepackage{hyperref} \usepackage{listings} \usepackage{microtype} \usepackage{fancyhdr} \hypersetup{ colorlinks=true, linkcolor=blue!55!black, urlcolor=blue!55!black, citecolor=blue!55!black, pdftitle={GIR: Gini Index Regression}, pdfauthor={David Diaz-Villarejo} } \pagestyle{fancy} \fancyhf{} \lhead{GIR} \rhead{Estimation and inference reference} \cfoot{\thepage} \setlength{\headheight}{14pt} \setlength{\parindent}{0pt} \setlength{\parskip}{0.55em} \allowdisplaybreaks \setlength{\emergencystretch}{2em} \makeatletter \renewcommand*\l@subsection{\@dottedtocline{2}{1.5em}{3.2em}} \makeatother \definecolor{codegray}{gray}{0.96} \definecolor{commentgreen}{RGB}{40,110,55} \definecolor{stringred}{RGB}{145,45,45} \definecolor{keywordblue}{RGB}{35,70,150} \lstdefinelanguage{R}{ morekeywords={function,if,else,for,while,repeat,in,next,break,TRUE,FALSE,NULL,NA,Inf,NaN}, sensitive=true, morecomment=[l]{\#}, morestring=[b]", morestring=[b]' } \lstset{ language=R, basicstyle=\ttfamily\small, keywordstyle=\color{keywordblue}\bfseries, commentstyle=\color{commentgreen}, stringstyle=\color{stringred}, backgroundcolor=\color{codegray}, frame=single, rulecolor=\color{black!15}, breaklines=true, breakatwhitespace=false, showstringspaces=false, columns=fullflexible, keepspaces=true, upquote=true, aboveskip=0.8em, belowskip=0.8em } \newcommand{\code}[1]{\texttt{\detokenize{#1}}} \newcommand{\R}{\mathbb{R}} \newcommand{\midcdf}{M} \newcommand{\mhat}{\widehat M} \newcommand{\thetahat}{\widehat\theta} \newcommand{\RtwoG}{R_G^2} \newcommand{\ind}{\mathbf{1}} \title{\textbf{GIR: Gini Index Regression}\\ \large Estimation, inference and prediction: detailed reference for \code{gir()}, \code{bboot.gir()}, and \code{predict.gir()}} \author{David D\'iaz-Villarejo} \date{Package version 0.2.1 --- October 2026} \begin{document} \maketitle \tableofcontents \newpage \section{Getting started} GIR estimates how the conditional Gini index varies with covariates. Use \code{gir()} to fit the model, \code{bboot.gir()} for bootstrap inference, and \code{predict()} to evaluate the fitted Gini index at chosen covariate values. The method is described in the working paper by Bhardwaj and D\'iaz-Villarejo \cite{girpaper}. This example fits a separate Gini index for each of two groups. The data include ties, which the conditional mid-distribution handles directly. The code and its output are regenerated when the package is built. <>= library(GIR) d <- data.frame(y = rep(c(1, 2, 2, 4, 5), 8), group = factor(rep(c("a", "b"), each = 20))) fit <- gir(y ~ 0 + group, data = d, discrete = "group") coef(fit) @ With group indicators in both stages, each coefficient is the empirical Gini index for that group, without a finite-sample correction. Bootstrap inference refits both stages using the same weights in each draw. <>= bb <- bboot.gir(fit, R = 499L, seed = 42L) confint(bb) predict(fit, data.frame(group = c("a", "b")), interval = "confidence", bootstrap = bb) @ The prediction intervals concern the conditional Gini index at each profile. They are not intervals for individual outcomes or simultaneous confidence bands. For more examples, including continuous covariates, see Section~\ref{sec:worked}. The remaining sections describe the arguments, calculations and diagnostics in detail. \section{Model and interface} \code{gir()} estimates the point coefficients of the linear Gini Index Regression (GIR) model. Its user interface follows the formula/data conventions of familiar R regression functions: the second-stage model is specified with a two-sided formula, an intercept is included by default, and the fitted object supports standard methods such as \code{summary()}, \code{coef()}, \code{fitted()}, \code{residuals()}, \code{model.frame()}, and \code{model.matrix()}. The package also provides \code{bboot.gir()} for two-stage Bayesian-bootstrap inference and \code{predict.gir()} for linear conditional Gini predictions and pointwise uncertainty. Their detailed references begin in Sections~\ref{sec:bootstrap} and~\ref{sec:prediction}. The GIR-specific goodness-of-fit statistic is an optional output of \code{gir()}. The first stage estimates the conditional mid-distribution function \[ \midcdf(y\mid x) = P(Y0\) multiplies \(G_g\), its right-hand side, and the penalty by \(c\), preserving the fitted values up to floating-point error within usable numerical ranges. Nonpositive or nonfinite matrix scales, penalties that underflow or overflow, and nonfinite adjusted matrices are rejected with informative errors. \item[\code{"drop"}] Use pivoted QR to identify a numerically independent subset of basis columns, remove the remaining columns, and report their names. The resulting effective sieve need not remain a complete tensor product. \item[\code{"none"}] Apply no proactive correction and pass the unmodified Gram matrix to \code{solve()}. A numerical failure remains an error. \end{description} \subsection*{\code{first_stage_tol}} The tolerance used in first-stage reciprocal-condition and QR-rank diagnostics. The default is \(10^{-12}\). A cell is marked problematic when its reciprocal condition number is nonfinite or below the tolerance, or when its numerical rank is below the number of basis columns. \subsection*{\code{ridge}} The relative ridge constant. It must be strictly positive when \code{first_stage_singular = "ridge"}; zero is allowed when ridge is not used. The default is \(10^{-10}\), a small numerical stabilization heuristic, not a universal regression default, a cross-validated choice, or a value prescribed by the paper's theory. A small penalty can still materially affect directions that the data identify poorly. Inspect the diagnostics and assess sensitivity to the ridge constant when using this option. The overall default remains \code{first_stage_singular = "error"}, which does not apply ridge. Earlier versions imposed a floor of 1 on the average Gram diagonal. Removing that floor can change both point estimates and bootstrap inference when ridge is active and the average diagonal is below 1. Affected analyses should refit and rerun their bootstrap. Ridge regularization remains a modification of the first-stage estimator requiring its own statistical justification. \subsection*{\code{minimum_cell_size}} The minimum number of positive-weight observations required in every observed joint discrete cell. The default is eight. A failure names the cell and reports both its total row count and positive-weight row count. \subsection*{\code{max_basis_columns}} A safety cap for the number of columns in a full tensor-product basis. The actual cell-specific upper bound is \[ \min\{\code{max_basis_columns},\ n_{+,g}-2\}, \] where \(n_{+,g}\) is the number of positive-weight observations in cell \(g\). The default package cap is 1000 columns. \subsection*{\code{singular.ok}} Controls second-stage rank deficiency in the style of \code{lm()}. \begin{itemize}[leftmargin=2em] \item \code{FALSE}: a singular second-stage moment matrix is an error; \item \code{TRUE}: pivoted QR retains an estimable subset, aliased coefficients are returned as \code{NA}, and a warning is issued. \end{itemize} The default is \code{TRUE}. A full-rank but ill-conditioned matrix is not regularized; the function returns the unregularized estimate and warns. \subsection*{\code{second_stage_tol}} The QR-rank and reciprocal-condition tolerance for the second stage. The default is \(10^{-7}\). \subsection*{\code{GIR}} A logical value. When \code{TRUE}, compute the GIR-specific goodness-of-fit measure based on the estimated conditional centered mid-rank. Let \(z_i=2\mhat_i-1\), let \(\widehat z_i=X_i'\thetahat\), and let \[ \widehat a_0 = \frac{\sum_iw_iY_i z_i}{\sum_iw_iY_i}. \] Then \[ \RtwoG = 1- \frac{\sum_iw_iY_i(z_i-\widehat z_i)^2} {\sum_iw_iY_i(z_i-\widehat a_0)^2}. \] When the unrestricted formula contains an intercept and the weighted GIR loss is nonnegative, the constant-only model is nested. Without an intercept, the function warns that the usual \([0,1]\) interpretation need not hold. \subsection*{\code{model}, \code{x}, and \code{y}} Logical retention controls: \begin{itemize}[leftmargin=2em] \item \code{model = TRUE}: retain the second-stage model frame; \item \code{x = TRUE}: retain the second-stage design matrix; \item \code{y = TRUE}: retain the response vector. \end{itemize} The flags govern these public slots. To support reproducible bootstrap refits, the fitted object also retains an \code{estimation} snapshot containing the distinct design rows with the index that maps observations to them, the response, weights, first-stage data and controls, irrespective of these three flags. Setting them to \code{FALSE} does not remove all underlying data from the object or make it anonymous. Observations with the same regressor values share a design row, so with cell-level regressors (industry and year effects in firm data, for example) the snapshot holds one row per cell rather than one per observation; \code{x = TRUE} expands it to the full design. \subsection*{\code{contrasts}} An optional contrast specification passed to \code{model.matrix()} for the second-stage formula. \section{First-stage dimension allocation in detail} \subsection{One continuous variable} When \(d=1\), there is no nontrivial tensor-product multiplication. The marginal dimension equals the total dimension. Under the default total-dimension rule with \(n_{\mathrm{ref}}=500\), \[ K=\lfloor500^{0.3}\rfloor=6, \qquad J_1=K-4=2, \] a cubic spline with two interior knots and six columns. The alternative \code{"knots"} convention applies the same number to the knot count instead, \[ J_1=6, \qquad m_1=J_1+4=10, \qquad K=m_1=10. \] \subsection{Two or more continuous variables} For \(d\geq2\), the total basis is the row-wise tensor product. If the marginal dimensions are \((m_1,\ldots,m_d)\), then \[ K=\prod_{\ell=1}^{d}m_\ell. \] Under \code{"dimension"}, the allocation algorithm chooses the \((m_1,\ldots,m_d)\) vector. Under \code{"knots"}, the user or automatic rule chooses \((J_1,\ldots,J_d)\), after which \(m_\ell=J_\ell+s_0\). The balanced allocation is a deterministic implementation convention; it does not infer variable importance. When a tie is resolved in favor of an earlier variable, changing the order of \code{continuous} can change which margin gets the final additional column. \section{Discrete cells and basis-size reference} With both continuous and discrete first-stage variables, the default \code{sieve_size_reference = "cell"} generally does \emph{not} force the same basis dimension in every cell. If cell sizes differ, the raw rules \[ \left\lfloor c n_g^\kappa\right\rfloor \] can differ. Feasibility capping or singularity handling can create further differences. To request a common nominal automatic size, use \code{sieve_size_reference = "full"}. To request a common fixed size, provide \code{sieve_size}. Even then, the actual basis can be reduced in a sparse cell, and \code{first_stage_singular = "drop"} can lower the effective dimension. Always inspect the diagnostics rather than inferring the realized dimensions from the call alone. \section{Diagnostics} For an internally estimated first stage, use \begin{lstlisting} d <- fit$first_stage$diagnostics \end{lstlisting} The data frame has one row per observed joint discrete cell. It contains the following fields. \begin{longtable}{>{\raggedright\arraybackslash}p{0.30\textwidth}p{0.64\textwidth}} \toprule Field & Meaning\\ \midrule \endhead \code{cell} & Human-readable joint discrete-cell label.\\ \code{observations} & Number of rows in the cell.\\ \code{positive_weight_}\newline\code{observations} & Number of rows with strictly positive observation weight.\\ \code{requested_size} & Raw requested scalar or knot vector before cell feasibility adjustments.\\ \code{size_type} & Realized interpretation: \code{"dimension"}, \code{"knots"}, or \code{"constant"}.\\ \code{marginal_dimensions} & A list-column. Each row contains a named integer vector \((m_1,\ldots,m_d)\), with names equal to \code{continuous}. These are the marginal basis dimensions actually constructed after size allocation and capping, but before optional QR column dropping.\\ \code{marginal_knot_counts} & A list-column. For \code{basis = "spline"}, each row contains the named integer vector \((J_1,\ldots,J_d)\). For Legendre bases, it contains a named vector of \code{NA_integer_} values because knot counts are not applicable.\\ \code{basis_dimension} & Total number of constructed tensor-product columns. With continuous variables, this equals \(\prod_\ell m_\ell\); with none, it equals one.\\ \code{effective_dimension} & Number of columns used after singularity handling. It differs from \code{basis_dimension} when \code{first_stage_singular = "drop"}.\\ \code{rank} & Numerical rank reported for the cell fit.\\ \code{rcond} & Reciprocal condition number of the original cell Gram matrix. Smaller values indicate worse conditioning.\\ \code{singular} & Whether the original cell design was diagnosed as singular or ill-conditioned.\\ \code{action} & \code{"none"}, \code{"ridge"}, or \code{"drop"}.\\ \code{ridge_lambda} & Actual ridge amount added to the Gram diagonal.\\ \code{dropped_columns} & Semicolon-separated names of columns removed by pivoted QR.\\ \code{capped} & Whether the requested size was reduced by a cell-specific feasibility limit.\\ \code{floored} & Whether the minimum tensor dimension (\(2^d\) for Legendre, \(s_0^d\) for splines) exceeded the requested size, so the minimum was used.\\ \bottomrule \end{longtable} The list-columns preserve named integer vectors rather than flattening them to text. Typical extraction is: \begin{lstlisting} # Complete vector in the first cell d$marginal_dimensions[[1L]] d$marginal_knot_counts[[1L]] # Stack all cells into ordinary matrices marginal_dimensions_by_cell <- do.call( rbind, d$marginal_dimensions ) marginal_knots_by_cell <- do.call( rbind, d$marginal_knot_counts ) \end{lstlisting} For example, a cubic two-dimensional spline cell with \begin{lstlisting} d$marginal_dimensions[[1L]] # x1 x2 # 7 5 d$marginal_knot_counts[[1L]] # x1 x2 # 3 1 \end{lstlisting} has \[ K=7\times5=35. \] If pivoted QR subsequently drops three interaction columns, the diagnostics can show \[ \code{basis_dimension}=35, \qquad \code{effective_dimension}=32. \] There need not exist a meaningful effective marginal vector whose product is 32, because QR may remove individual tensor interactions rather than an entire marginal function. The reported marginal vectors therefore describe the constructed tensor basis before column dropping. \section{Pivoted QR and aliasing} For a matrix \(P\), an ordinary QR decomposition writes \[ P=QR, \] where \(Q\) has orthonormal columns and \(R\) is upper triangular. A column-pivoted QR decomposition writes \[ P\Pi=QR, \] where \(\Pi\) permutes the columns. The algorithm attempts to move informative, linearly independent columns first and redundant columns last. For example, the design \[ P=\begin{bmatrix}\mathbf 1 & x & 2x\end{bmatrix} \] has three columns but rank two because its third column is twice its second. Pivoted QR retains two independent columns and identifies one aliased column. In the first stage, \code{"drop"} applies pivoted QR to the weighted design \(\operatorname{diag}(\sqrt w)P\). In the second stage, \code{singular.ok = TRUE} uses the same principle to report estimable coefficients and return \code{NA} for aliased ones. Rank deficiency and ill-conditioning are not identical. A matrix may be full rank but nearly singular. The GIR package therefore records both QR rank and reciprocal condition number. \section{Value} An object of class \begin{lstlisting} c("gir", "gir.object") \end{lstlisting} with principal components: \begin{longtable}{>{\raggedright\arraybackslash}p{0.31\textwidth}p{0.63\textwidth}} \toprule Component & Contents\\ \midrule \endhead \code{coefficients} & Named point estimates, with aliased entries set to \code{NA}.\\ \code{coefficients.complete} & A complete coefficient vector used for fitted values, with zero in aliased positions.\\ \code{fitted.values} & Fitted linear conditional Gini index \(X_i'\widehat\theta\); equivalently the fitted index in the generated mid-rank regression.\\ \code{residuals} & \((2\widehat M_i-1)-X_i'\widehat\theta\).\\ \code{rank}, \code{df.residual}, \code{aliased} & Second-stage rank information.\\ \code{midcdf} & Named vector \((\widehat M_1,\ldots,\widehat M_n)\).\\ \code{centered.midrank} & Named vector \(2\widehat M_i-1\).\\ \code{GIR.R2} & \code{NULL} unless \code{GIR = TRUE}; otherwise a list containing the value, restricted coefficient, unrestricted loss, and restricted loss.\\ \code{first_stage} & First-stage specification, bounds, cell factor, clipping information, singularity settings, and diagnostics.\\ \code{second_stage} & Singularity indicators, reciprocal condition number, tolerance, moment matrix, and moment vector.\\ \code{call}, \code{formula}, \code{terms}, \code{contrasts}, \code{xlevels}, \code{assign} & Formula and design metadata.\\ \code{weights} & Final estimation-sample weights.\\ \code{na.action} & Omission information, when applicable.\\ \code{nobs}, \code{original.nobs}, \code{subset.nobs}, \code{row.index} & Sample-size and row-alignment information.\\ \code{model}, \code{x}, \code{y} & Retained model frame, design, and response according to the retention arguments.\\ \code{estimation} & Resolved estimation snapshot for refitting and prediction, retained independently of the public-slot flags: the distinct design rows, the index mapping observations to them, response, weights, first-stage data and controls.\\ \bottomrule \end{longtable} \section{Methods} The current object supports: \begin{lstlisting} print(fit) summary(fit) coef(fit) fitted(fit) residuals(fit) weights(fit) nobs(fit) formula(fit) terms(fit) model.frame(fit) model.matrix(fit) midcdf(fit) summary(midcdf(fit)) \end{lstlisting} \code{summary(fit)} remains the point-estimator summary and prints a one-column coefficient table. Use \code{summary(bboot.gir(fit, ...))} for inference; the point object is not silently refitted by its summary method. \code{summary(midcdf(fit))} uses the ordinary numeric vector summary and reports the minimum, quartiles, median, mean, and maximum. \section{Warnings and errors} \subsection*{Errors} The function stops for, among other cases: \begin{itemize}[leftmargin=2em] \item missing data under the default \code{na.fail}; \item empty input, an empty subset, or no observations after missing-value handling; \item nonnumeric or nonfinite response values; \item negative or infinite weights, or no positive weight in the retained sample; \item first-stage columns not found in \code{data}; \item overlap between \code{continuous} and \code{discrete}; \item an undeclared numeric first-stage column with at most two distinct values; \item observed continuous values outside \code{basis_bounds}; \item a sparse joint discrete cell; \item a cell too small for the minimum tensor basis (\(2^d\) Legendre or \(s_0^d\) spline columns); \item first-stage singularity under \code{"error"}, including a marginal basis with more columns than its variable has distinct values in a cell; \item a failed unregularized solve under \code{"none"}; \item second-stage singularity when \code{singular.ok = FALSE}. \end{itemize} \subsection*{Warnings} The function warns when: \begin{itemize}[leftmargin=2em] \item one or more response values are strictly negative; \item observations are removed by \code{na.omit} or \code{na.exclude}; \item a custom action removes rows (with separate counts for missing and complete rows); \item first-stage fitted values fall outside \([0,1]\), whether or not clipped; \item a requested first-stage basis is capped; \item first-stage singularity is handled by ridge or column dropping, including the case of a marginal basis larger than its variable's support, which is identified in the warning; \item the second-stage design is rank deficient or ill-conditioned; \item \(R_G^2\) is undefined or requested without an intercept. \end{itemize} A negative response does not mechanically prevent calculation of the moment estimator, but it undermines the usual Gini interpretation and the ordinary nonnegative-loss interpretation of \(R_G^2\). \section{Examples} The examples below assume that the package has been installed and attached with \code{library(GIR)}. \subsection{Basic fit with one continuous and two binary first-stage variables} \begin{lstlisting} fit <- gir( y ~ x1 + x2 + x3, data = dat, first_stage = ~ x1 + x2 + x3, continuous = "x1", discrete = c("x2", "x3"), basis = "legendre", GIR = TRUE ) summary(fit) summary(midcdf(fit)) fit$first_stage$diagnostics \end{lstlisting} The two binary variables generate up to four observed cells. The Legendre basis is estimated separately in each cell. \subsection{A numeric discrete variable with four values} \begin{lstlisting} fit4 <- gir( y ~ x + factor(d), data = dat4, first_stage = ~ x + d, continuous = "x", discrete = "d", # important: d is numeric basis = "spline", spline_order = 4L ) levels(fit4$first_stage$cells) fit4$first_stage$diagnostics \end{lstlisting} If \code{d} takes \(1,2,3,4\), the first-stage diagnostic table has one row per observed value. The second-stage formula uses \code{factor(d)} to avoid imposing a linear effect in the numerical labels. \subsection{A Legendre specification with known support bounds} \begin{lstlisting} fit_legendre <- gir( y ~ 0 + x1 + x2 + x3, data = dat, first_stage = ~ x1 + x2 + x3, continuous = "x1", discrete = c("x2", "x3"), basis = "legendre", kappa = 0.245, basis_constant = 1, sieve_size_type = "dimension", sieve_size_reference = "cell", basis_bounds = list(x1 = c(0.1, 1)), clip = FALSE, first_stage_singular = "ridge", first_stage_tol = 1e-12, ridge = 1e-10, singular.ok = FALSE ) \end{lstlisting} \subsection{A cubic spline specification with knots per margin} \begin{lstlisting} fit_spline <- gir( y ~ 0 + x1 + x2 + x3, data = dat, first_stage = ~ x1 + x2 + x3, continuous = "x1", discrete = c("x2", "x3"), basis = "spline", kappa = 0.300, basis_constant = 1, sieve_size_type = "knots", sieve_size_reference = "cell", spline_order = 4L, basis_bounds = list(x1 = c(0.1, 1)), clip = FALSE, first_stage_singular = "ridge", first_stage_tol = 1e-12, ridge = 1e-10, singular.ok = FALSE ) \end{lstlisting} Here \code{sieve_size_type = "knots"} makes \(\lfloor n_g^{0.3}\rfloor\) the number of interior knots in cell \(g\) rather than the total dimension. With one continuous regressor, the cell's marginal and total dimensions equal the knot count plus four. \subsection{Target total dimension with two continuous regressors} \begin{lstlisting} fit_35 <- gir( y ~ x1 + x2, data = dat2, first_stage = ~ x1 + x2, continuous = c("x1", "x2"), basis = "spline", spline_order = 4L, sieve_size_type = "dimension", sieve_size = 35L, first_stage_singular = "ridge" ) fit_35$first_stage$diagnostics$marginal_dimensions[[1L]] # x1 x2 # 7 5 fit_35$first_stage$diagnostics$marginal_knot_counts[[1L]] # x1 x2 # 3 1 \end{lstlisting} Provided the cell-size cap does not bind, the tensor dimension is \(7\times5=35\). With target 50, the balance-oriented path returns \((7,7)\), hence 49 columns, rather than searching globally for the unbalanced factorization \(10\times5=50\). \subsection{Directly specify marginal spline knots} \begin{lstlisting} fit_knots <- gir( y ~ x1 + x2, data = dat2, first_stage = ~ x1 + x2, continuous = c("x1", "x2"), basis = "spline", spline_order = 4L, sieve_size_type = "knots", sieve_size = c(3L, 1L) ) \end{lstlisting} This explicitly requests marginal dimensions \((7,5)\) and total dimension 35. A scalar \code{sieve_size = 3L} would request three knots in both margins and total dimension \(7^2=49\). \subsection{Compare cell and full reference sizes} \begin{lstlisting} fit_cell <- gir( y ~ x + factor(d), data = dat4, first_stage = ~ x + d, continuous = "x", discrete = "d", basis = "spline", sieve_size_reference = "cell" ) fit_full <- gir( y ~ x + factor(d), data = dat4, first_stage = ~ x + d, continuous = "x", discrete = "d", basis = "spline", sieve_size_reference = "full" ) fit_cell$first_stage$diagnostics[ c("cell", "requested_size", "marginal_dimensions") ] fit_full$first_stage$diagnostics[ c("cell", "requested_size", "marginal_dimensions") ] \end{lstlisting} \subsection{Supply the first-stage estimates} \begin{lstlisting} fit_external <- gir( y ~ treatment + x1 + x2, data = dat, midcdf = external_midcdf, clip = FALSE, singular.ok = FALSE ) # A data-column name is also accepted. fit_external_2 <- gir( y ~ treatment + x1 + x2, data = dat, midcdf = "external_midcdf" ) \end{lstlisting} \subsection{Weights and missing values} \begin{lstlisting} fit_weighted <- gir( y ~ treatment + x, data = dat, weights = survey_weight, na.action = stats::na.omit, first_stage = ~ treatment + x, continuous = "x", discrete = "treatment", basis = "spline" ) \end{lstlisting} Rows incomplete in any required object are removed together, and the same weights enter both stages. \subsection{Inspect clipping} \begin{lstlisting} fit_unclipped <- gir( y ~ x, data = dat, continuous = "x", basis = "legendre", clip = FALSE ) fit_clipped <- gir( y ~ x, data = dat, continuous = "x", basis = "legendre", clip = TRUE ) range(midcdf(fit_unclipped)) range(midcdf(fit_clipped)) \end{lstlisting} \subsection{First-stage singularity policies} \begin{lstlisting} fit_strict <- gir( y ~ x, data = dat, continuous = "x", basis = "spline", first_stage_singular = "error" ) fit_ridge <- gir( y ~ x, data = dat, continuous = "x", basis = "spline", first_stage_singular = "ridge", ridge = 1e-10 ) fit_drop <- gir( y ~ x, data = dat, continuous = "x", basis = "spline", first_stage_singular = "drop" ) \end{lstlisting} After a ridge or drop fit, inspect \begin{lstlisting} fit_ridge$first_stage$diagnostics[ c("cell", "singular", "action", "ridge_lambda") ] fit_drop$first_stage$diagnostics[ c("cell", "basis_dimension", "effective_dimension", "action", "dropped_columns") ] \end{lstlisting} \subsection{Strict second-stage singularity behavior} \begin{lstlisting} fit <- gir( y ~ x1 + x2, data = dat, singular.ok = FALSE ) \end{lstlisting} This stops rather than returning aliased coefficients when the GIR moment matrix is singular. \subsection{GIR goodness of fit} \begin{lstlisting} fit_r2 <- gir( y ~ treatment + x1 + x2, data = dat, first_stage = ~ treatment + x1 + x2, continuous = c("x1", "x2"), discrete = "treatment", basis = "spline", GIR = TRUE ) summary(fit_r2) fit_r2$GIR.R2 \end{lstlisting} \section{\texorpdfstring{\code{bboot.gir}: Bayesian bootstrap inference}{bboot.gir: Bayesian bootstrap inference}} \label{sec:bootstrap} \subsection{Name and description} \code{bboot.gir()} obtains Bayesian-bootstrap coefficient draws from a fitted linear GIR model. In its default mode it re-estimates both the conditional mid-distribution first stage and the GIR second stage using the same mean-one exponential multipliers. It reports the basic confidence intervals in Algorithm 2 of the paper, bootstrap standard errors and covariance, bootstrap bias estimates, and centered-bootstrap hypothesis tests. The interval construction and two-stage resampling scheme are taken from Algorithm 2 of the paper \cite{girpaper}. Exact ties use the mid-distribution response of the paper's first stage. The standard errors, smooth transformations, marginal tests, joint Wald test and prediction standard errors are package extensions; their assumptions and calculations are described below. \subsection{Usage} \begin{lstlisting} bboot.gir( object, R = 999L, level = 0.95, ..., transform = NULL, null = 0, alternative = c("two.sided", "less", "greater"), joint = FALSE, seed = NULL, cluster = NULL, cluster_order = c("auto", "original", "estimation"), bootstrap_weights = NULL, normalize_weights = TRUE, first_stage_boot = c("refit", "fixed"), midcdf_boot = NULL, inference = TRUE, keep_weights = FALSE, keep_midcdf = FALSE, failure = c("error", "omit") ) \end{lstlisting} The preferred workflow separates estimation from inference: \begin{lstlisting} fit <- gir(y ~ x + factor(d), data = dat, first_stage = ~ x + d, continuous = "x", discrete = "d") bb <- bboot.gir(fit, R = 999L, level = 0.95, seed = 42L) summary(bb) confint(bb) vcov(bb) \end{lstlisting} Here and below, examples using an unspecified \code{dat} illustrate syntax; Section~\ref{sec:worked} supplies a complete runnable data-generating example. \subsection{Bootstrapping a fitted model} The fitted object identifies the actual estimation sample after \code{subset} and missing-value processing, the second-stage columns and contrasts, the continuous/discrete first-stage classification, and all selected cell-specific basis dimensions. Repeating a call against a subsequently modified data frame could otherwise change the estimator being bootstrapped. A \code{gir} fit retains the data and settings used for estimation. \code{bboot.gir(fit)} uses that snapshot, not the possibly changed data named in \code{fit$call}. It does not allow extra \code{gir()} arguments when a fitted object is supplied. To change the basis or formula, fit the new point estimator first, then bootstrap that fit. A formula convenience form is also available: \begin{lstlisting} bb <- bboot.gir( y ~ x + factor(d), data = dat, first_stage = ~ x + d, continuous = "x", discrete = "d", basis = "spline", spline_order = 4L, singular.ok = FALSE, R = 999L, level = 0.95, seed = 42L ) fit <- bb$fit \end{lstlisting} In this form, the first argument is the formula, not a fitted model. The additional, fully named arguments are passed to \code{gir()} once. Expressions for \code{subset}, \code{weights}, and a supplied \code{midcdf} are evaluated through the same data-based machinery as in a direct \code{gir()} call. \code{R}, \code{level}, and the other explicit bootstrap arguments remain bootstrap options, not point-estimator arguments. \subsection{Arguments: model, replicates and confidence level} \paragraph{\code{object}.} Supply a fit created by \code{gir()}. A two-sided formula is accepted as the convenience form above. An older saved fit without the estimation snapshot must be refitted with the current function. A fitted second-stage model with aliased coefficients is not accepted for bootstrap coefficient inference: use an identified, full-rank specification. \paragraph{\code{R}.} The positive integer number of requested bootstrap replicates. Its default is 999. This is denoted by \(B\) in the mathematical formulas below. If a \code{bootstrap_weights} matrix is supplied and \code{R} is omitted, its number of columns determines \code{R}; an explicitly supplied inconsistent value is an error. With \code{inference=TRUE}, at least two successful draws are required. The choice \code{R=1, inference=FALSE} provides a single draw, as used in a warp-speed Monte Carlo study; it does not provide a usable sample-specific standard error or confidence interval. \paragraph{\code{level}.} A scalar strictly between zero and one; the default is 0.95. The confidence intervals are two-sided, equal-tailed basic bootstrap intervals at that level. Changing the test's \code{alternative} does not change these intervals into one-sided bounds. A different interval level can be obtained from stored draws with \code{confint(bb, level=0.90)} or \code{summary(bb, level=0.90)}. For a two-sided level \(1-\alpha\), only about \(B\alpha/2\) draws inform each tail. The summary warns when this number is below ten. This is a numerical precision diagnostic, not a theorem about a universally adequate value of \(B\). The small \(B\) values used in unit tests and algebraic illustrations are not recommended for reported empirical tail inference. \subsection{Arguments: transformations and hypotheses} \paragraph{\code{transform}.} Defines \(h(\theta)\), the statistic or vector of statistics to test. It does not replace the raw coefficients stored in \code{t0} and \code{t}. The accepted forms are: \begin{description}[style=nextline,leftmargin=1.8cm] \item[\code{NULL}] Use all coefficients, in their original order. With \code{null=0}, this gives separate coefficient-zero tests by default. \item[Numeric vector] An unnamed vector must have one entry per coefficient and defines a single linear contrast. A named vector can select a subset of coefficient names; all unmentioned coefficients receive weight zero. For example, \code{c(x2=1, x3=-1)} defines \(h(\theta)=\theta_{x2}-\theta_{x3}\). The resulting statistic is named \code{contrast}. \item[Numeric matrix] Each row defines a linear contrast. An unnamed matrix must have one column per coefficient. Named columns may be supplied in any order and may select a subset; omitted coefficient columns are filled with zero. Row names label the statistics; absent row names are generated as \code{contrast1}, and so on. \item[Function] A deterministic function of the named coefficient vector. It must return a finite numeric vector of the same length and with the same names for the point estimate and every successful draw. An unnamed result is assigned names \code{statistic1}, and so on. Undefined ratios, logs, or other nonfinite values cause an error rather than selective deletion of transformed draws. \end{description} The intended theoretical class is smooth transformations with a nondegenerate first derivative at the true parameter. The numerical interface does not verify this mathematical condition. In particular, \(h(\theta)=\theta_j^2\) when \(\theta_{0j}=0\), absolute values at zero, maxima at ties, and ratios with nearly zero denominators may be nonregular; obtaining numeric output does not establish bootstrap validity for them. For joint inference, the derivative matrix of the restrictions must have full row rank at the null. A necessary check, enforced in the code, is that the number of restrictions does not exceed the number of coefficients; that check is not sufficient on its own. \paragraph{\code{null}.} The hypothesized value \(r\) in \(H_0:h(\theta_0)=r\). An unnamed scalar is repeated for all transformed components. An unnamed vector must have exactly one entry per component. A named vector must match all transformed statistic names exactly and is reordered accordingly. The default is zero. For a coefficient ratio equal to one, supply \code{null=1}; for a log-ratio equal to zero, supply \code{null=0}. \paragraph{\code{alternative}.} \code{"two.sided"} uses twice the smaller centered-bootstrap tail probability, capped at one. \code{"less"} tests against \(h_j(\theta_0)r_j\). The same alternative applies to each component. Marginal p-values are not adjusted for multiple testing. \paragraph{\code{joint}.} If \code{TRUE}, also compute the centered, common-covariance bootstrap Wald test of all supplied restrictions jointly. It requires \code{alternative="two.sided"}. This is not the ordinary OLS F test, and it does not use a Student or F reference distribution. A singular or numerically ill-conditioned bootstrap restriction covariance yields an explicit warning and an undefined joint statistic/p-value, not an arbitrary generalized-inverse test. Remove redundant restrictions or obtain more draws as appropriate. For example, testing both \(\theta_2-\theta_3=0\) and \(\theta_2/\theta_3=1\) jointly is redundant when the denominator is nonzero. Use one of these equivalent restrictions, not both as independent restrictions. \subsection{Arguments: random weights and reproducibility} \paragraph{\code{seed}.} \code{NULL} uses and advances the caller's random-number stream. A nonnegative integer initializes a local seeded computation and restores both the caller's RNG kind and its previous \code{.Random.seed} on exit, including error exits. A supplied seed and supplied bootstrap multipliers cannot be used together. \paragraph{\code{cluster}.} Optional clustering of the multipliers. A one-sided formula such as \code{~ industry} names retained model-frame or first-stage columns, whose combination defines the clusters (\code{~ industry + region} clusters on the intersection); a vector supplies one cluster value per estimation row, or one per row of the original data. The \code{cluster_order} argument below determines how a vector is aligned. For each replicate one \(\mathrm{Exp}(1)\) value is drawn per cluster and shared by all its observations in both stages, after which the vector is normalized by its observation-level mean as usual. This is the Bayesian cluster bootstrap and is the appropriate choice when observations are dependent within groups, for example firms within industries when the treatment varies at the industry level. It cannot be combined with \code{bootstrap_weights}; a supplied multiplier matrix already fixes the dependence structure. Each distinct combination of values defines a cluster. Group membership uses the values in each column, so labels such as \code{("a.b", "c")} and \code{("a", "b.c")} remain distinct. Numeric identifiers are distinguished by their stored values rather than their printed formatting. A formula such as \code{~ industry + region} specifies one-way clustering at industry-region intersections, not two-way clustering by industry and region separately. Clusters are numbered in order of first occurrence in the estimation rows; changing labels while preserving group membership preserves seeded multipliers. When every first-stage cell lies inside a single cluster, the cell fits are invariant to the common multiplier of that cluster, so the first stage does not vary across draws and the bootstrap distribution reflects between-cluster variation only. The estimated first stage then enters the inference through the residual variation across clusters, exactly as in a clustered regression of cell Gini indices; the returned \code{cluster$first_stage_invariant} reports whether this is the case. The paper's validity theorem covers independent observations; clustered inference rests on the usual many-clusters argument and is the researcher's responsibility. \paragraph{\code{cluster_order}.} Specifies the row order of a cluster vector: \begin{itemize} \item \code{"original"} requires one label per original-data row, in the order at the time \code{gir()} was called. The vector is aligned to the final estimation sample using \code{fit$row.index}, including subsetting, reordering, repeated selections, and removal of incomplete observations. \item \code{"estimation"} requires one label per final estimation row and uses the vector unchanged. For example, a vector already constructed as \code{dat$id[fit$row.index]} has this order. \item \code{"auto"} (the default) infers the order when the vector length matches only one of the original-data and estimation-sample sizes. If both sizes match, it accepts the vector only when the row mapping is unchanged. Otherwise it stops and asks for an explicit order, since length alone cannot distinguish original-order labels from already-aligned labels. \end{itemize} Missing cluster labels are checked after alignment. A missing label on a discarded original row is harmless; a missing label on a used row is rejected. Non-default values require a cluster vector. Leave \code{"auto"} for a cluster formula, whose retained columns are already aligned, or for \code{cluster = NULL}. For example, keeping all six observations in a different order requires an explicit choice for a vector. The following computes draws only to illustrate alignment: \begin{verbatim} cluster_dat <- data.frame(y = c(1, 4, 2, 7, 3, 9), id = c("A", "A", "B", "B", "C", "C")) cluster_fit <- gir(y ~ 1, data = cluster_dat, subset = c(1, 3, 5, 2, 4, 6), first_stage = ~ id, discrete = "id", minimum_cell_size = 1L) cluster_boot <- bboot.gir(cluster_fit, cluster = cluster_dat$id, cluster_order = "original", R = 3L, seed = 17L, inference = FALSE) cluster_boot$cluster$index # 1 2 3 1 2 3 \end{verbatim} An equivalent call supplies \code{cluster_dat$id[cluster_fit$row.index]} with \code{cluster_order = "estimation"}. A retained-column formula \code{cluster = ~ id} also gives the same grouping without a vector-order choice. Earlier analyses that supplied misaligned vectors should rerun their bootstrap: inference can change even when the cluster count is unchanged. Point estimates are unaffected. \paragraph{\code{bootstrap_weights}.} Optional positive finite multipliers, supplied as an \(n_{\mathrm{used}}\times B\) matrix, with observations in rows and replicates in columns. A numeric vector gives one replicate. The order must be the final estimation-row order, not the original unfiltered data order. These are multipliers, not original observation weights and not products of the two. The code multiplies them by \code{fit$weights} once. This argument allows paired comparisons: the same multiplier vector can be passed to Legendre, spline, and oracle fits. Supplying it consumes no random numbers in the internal GIR implementation. An external \code{midcdf_boot} callback must also avoid extra randomness for this property to apply to the entire computation. \paragraph{\code{normalize_weights}.} With \code{TRUE}, divide each supplied multiplier column by its own mean. With \code{FALSE}, use and store the supplied entries unchanged. For the internal estimator, including relative ridge handling, a common rescaling preserves the draws up to floating-point error within usable numerical ranges. External first-stage callbacks must respect weight scaling themselves. Generated exponential multipliers are always normalized as in Algorithm 2, irrespective of this option. Normalization is over the full estimation sample, not separately inside each discrete cell. Zero or negative supplied multipliers are rejected because they are not the positive exponential-weight scheme implemented here. Original case weights may be zero, as in \code{gir()}; their effective bootstrap weights remain zero. Underflow or overflow in the combined weights is an error, not a reason to draw a replacement multiplier vector. \subsection{Arguments: first-stage refitting} \paragraph{\code{first_stage_boot}.} The default \code{"refit"} re-estimates the first stage for every multiplier draw. It uses the original sample, cells, support transformation, knot locations, constructed marginal dimensions, and tensor-product specification. The original numerical singularity policy and clipping rule are applied again under the bootstrap weights. The numerical rank and any dropped columns can therefore change with the weights if the selected policy allows it; those changes are recorded in the diagnostics. The explicit alternative \code{"fixed"} holds the original mid-CDF vector fixed and reweights only the second stage. It is suitable for an oracle first stage, where the true conditional distribution is treated as known, or another truly known nuisance. It is not the default for an estimated first stage and produces a warning when inferential summaries are requested. Holding an estimated first-stage vector fixed generally omits its estimation effect. \paragraph{\code{midcdf_boot}.} An optional callback for a point fit with an externally supplied first stage: \begin{lstlisting} function(object, weights, replicate) { # Re-estimate the external method under these combined weights. # Return one mid-CDF value per retained estimation row. } \end{lstlisting} The \code{weights} argument contains the product of the original observation weights and that replicate's multiplier vector, which is left unnormalized when supplied with \code{normalize_weights = FALSE}. The callback must return a finite numeric vector of length \code{nobs(object)} in the same row order. The original clipping rule is subsequently applied. A stored external mid-CDF vector alone is not enough to reconstruct how it was estimated. Thus \code{first_stage_boot="refit"} errors for such a fit unless this callback is supplied. A callback is not accepted for an internally estimated series first stage or together with \code{first_stage_boot="fixed"}. The callback's own statistical validity remains the researcher's responsibility. \subsection{Arguments: output, failure handling and extra arguments} \paragraph{\code{inference}.} \code{TRUE} computes intervals, standard errors, bias summaries, and tests. \code{FALSE} returns raw draws and diagnostics without those summaries. With at least two successful stored draws, \code{summary(bb)} can compute summaries later, even if the original call was draw-only. One draw alone is insufficient. \paragraph{\code{keep_weights}.} Retain the multiplier matrix as used in \code{bb$bootstrap_weights}; supplied values remain unnormalized when \code{normalize_weights = FALSE}. The default \code{FALSE} avoids storing an additional \(n\times B\) matrix. These saved values are the multipliers, not the combined case weights. \paragraph{\code{keep_midcdf}.} Retain the first-stage fitted values for every draw in \code{bb$midcdf}, an \(n\times B\) matrix. This is useful for nuisance diagnostics and reproducibility checks, but can use substantial memory. For example, \(n=100000\) and \(B=999\) require roughly 800 MB for the numeric entries of one such matrix, before object overhead. The default is \code{FALSE}. \paragraph{\code{failure}.} \code{"error"} stops at the first failed replicate with its number and reason. This is the default. \code{"omit"} keeps the failed replicate's entire coefficient row as \code{NA}, records the error, and computes summaries from successful rows only, with a warning. It never redraws until a successful fit appears. Omitting failures conditions on numerical success and can distort inference; a substantial failure rate should be investigated, not accepted as routine. An undefined coefficient transformation is an error even with this option, because selectively removing transformed draws would change the statistic's bootstrap distribution. \paragraph{\code{...}.} Only the formula convenience form passes these fully named options to \code{gir()}. With a fitted object, any extra argument is an error. Thus a misspelling or an attempted change of basis cannot silently leave the original point estimator and bootstrap estimator different. \subsection{The two-stage bootstrap calculation} For clarity, write \(a_i\) for the original case weights (equal to one in the paper's baseline sampling setting), and \(w_i^{*(b)}\) for the bootstrap multipliers. For each replicate \(b\), draw \[ e_i^{(b)}\stackrel{\mathrm{iid}}{\sim}\mathrm{Exp}(1), \qquad \bar e^{(b)}=\frac1n\sum_{i=1}^n e_i^{(b)}, \qquad w_i^{*(b)}=e_i^{(b)}/\bar e^{(b)}. \] Let \(a_i^{*(b)}=a_iw_i^{*(b)}\). Within a discrete cell \(g\), form \begin{align*} Q_g^{*(b)}&=\sum_{j\in\mathcal I_g}a_j^{*(b)}p_jp_j',\\ S_g^{*(b)}(Y_i)&=\sum_{j\in\mathcal I_g}a_j^{*(b)}p_j \left\{\ind(Y_j{\raggedright\arraybackslash}p{0.30\textwidth}p{0.64\textwidth}} \toprule Component & Meaning \\ \midrule \endhead \code{fit} & The point-estimation object used, including its resolved data and basis specification.\\ \code{t0} & Named raw coefficient vector \(\widehat\theta\).\\ \code{t} & \(R\times p\) raw coefficient draws; failed rows are entirely \code{NA}.\\ \code{R}, \code{R.success}, \code{success} & Requested count, successful count, and logical success indicator.\\ \code{std.error}, \code{covariance} & Raw coefficient bootstrap SEs and covariance.\\ \code{conf.int}, \code{bias} & Raw basic intervals and bootstrap mean-minus-estimate bias.\\ \code{coefficient.table} & Raw Estimate, Boot. SE, Boot. bias, lwr and upr table.\\ \code{test} & Transformed estimate/null/deviation, SEs, covariance, basic intervals, marginal p-values, and optional joint test.\\ \code{level}, \code{quantile.type} & Requested level and quantile type 7.\\ \code{transform}, \code{null}, \code{alternative}, \code{joint} & Inferential specification.\\ \code{first_stage_boot} & Refitted, fixed, or external-refit mode.\\ \code{cluster} & \code{NULL}, or the number of clusters, the cluster index over estimation rows, and whether the first-stage cells are nested in the clusters.\\ \code{seed}, \code{rng.kind}, \code{rng.start} & Seed option, RNG kind, and captured starting RNG state.\\ \code{bootstrap_weights} & Optional saved multipliers as used, \(n\times R\).\\ \code{midcdf} & Optional saved first-stage draw matrix, \(n\times R\).\\ \code{diagnostics} & One row per attempted replicate, including success/error, conditioning and warning information.\\ \bottomrule \end{longtable} With \code{inference=FALSE}, the summary fields are \code{NULL}; draw matrices and diagnostics remain available. Extraction and reanalysis use: \begin{lstlisting} coef(bb) # raw point coefficients, not bootstrap means vcov(bb) # raw coefficient covariance confint(bb, level = 0.90) # raw coefficient basic intervals confint(bb, parm = c("x2", "x3")) summary(bb, transform = c(x2 = 1, x3 = -1), null = 0) bb$test$conf.int # transformed intervals from the original call bb$test$p.value bb$test$joint bb$diagnostics \end{lstlisting} \code{summary(bb)} can change the confidence level, transformation, null, alternative, and joint-test choice without refitting or generating draws. Its coefficient table concerns the raw coefficients; its \code{test} component concerns the selected transformations. The original \code{bb} is not mutated by obtaining a new summary. The bootstrap diagnostics include the minimum first-stage reciprocal condition number across cells, labels of cells receiving a numerical adjustment, the number of out-of-range mid-CDF values before clipping, second-stage reciprocal condition number, error messages, and a list of captured warning messages. Original cellwise marginal dimension/knot vectors remain at \code{bb$fit$first_stage$diagnostics}. The constructed basis allocation is fixed throughout that bootstrap run. \section{\texorpdfstring{\code{predict.gir}: linear conditional Gini predictions}{predict.gir: linear conditional Gini predictions}} \label{sec:prediction} \subsection{Name, target and usage} \code{predict.gir()} evaluates the fitted linear conditional Gini index at specified covariates. It is normally invoked through the standard generic \code{predict(fit, ...)}. The target is \[ G(x)=x'\theta_0\quad\hbox{under correct specification}, \qquad \widehat G(x)=x'\widehat\theta. \] Under misspecification, \(x'\theta_0\) is the fitted linear-approximation target identified in the paper, not necessarily the true CGIF at each individual \(x\). Confidence statements concern that approximation target when the model is misspecified. The method does not predict \(Y\), \(E[Y\mid X]\), or \(M(y\mid x)\). A model for the conditional Gini alone does not specify the conditional law needed for individual-outcome prediction intervals. \begin{lstlisting} predict.gir( object, newdata = NULL, se.fit = FALSE, interval = c("none", "confidence"), level = 0.95, bootstrap = NULL, R = 999L, seed = NULL, na.action = stats::na.pass, ... ) \end{lstlisting} \subsection{Arguments} \paragraph{\code{object}.} A current \code{gir} fit. New uncertainty calculations require an identified, full-rank coefficient specification. Point predictions from aliased fits are allowed only where the requested linear function is estimable; see below. \paragraph{\code{newdata}.} A data frame containing the raw predictor variables used by the second-stage formula. The response and variables used only in the first stage are not needed. \code{NULL} uses the original retained second-stage design and produces values in the same order as \code{fitted(fit)}. That order contains the estimation sample only; it does not reinsert observations removed by the original fit, even when the original fitting action was \code{na.exclude}. Use \code{fit$row.index} to map to original data rows. For new data, the method uses the original model terms, contrasts, and factor levels. Training parameters stored by safe formula transformations such as \code{poly(x, 2)} or \code{splines::bs(x, ...)} are reused. New factor levels are errors; missing required predictors are errors rather than an intentional fallback to an unrelated vector in the calling environment. Custom formula functions must themselves support meaningful evaluation on new observations. \paragraph{\code{se.fit}.} If \code{FALSE}, return a prediction vector or interval matrix. If \code{TRUE}, return a list with components \code{fit}, \code{se.fit}, \code{level}, \code{method}, and \code{R}. SEs concern the estimated linear index, not observation noise. Setting this option requests a bootstrap when none is supplied. \paragraph{\code{interval}.} \code{"none"} returns point values. \code{"confidence"} returns a matrix with columns \code{fit}, \code{lwr}, and \code{upr}, using pointwise basic bootstrap intervals. There is no \code{"prediction"} option for individual outcomes and no simultaneous confidence-band option in this version. \paragraph{\code{level}.} Confidence level strictly between zero and one. Its default is 0.95, even if an existing bootstrap object was originally summarized at a different level. The stored draws can be reused at the level requested here. \paragraph{\code{bootstrap}.} An optional matching result of \code{bboot.gir(fit, ...)}. Reusing it is the preferred method when several predictions or transformed tests are needed. Compatibility is checked against the raw coefficient vector, estimation snapshot, first-stage specification, and point mid-CDF vector. A bootstrap of a different sample or modified estimator is rejected. Raw coefficient draws are used even if the supplied bootstrap result also contains tests of nonlinear transformations. \paragraph{\code{R} and \code{seed}.} Used only for an automatic \code{bboot.gir()} call when uncertainty is requested and \code{bootstrap=NULL}. They have the same meaning as in that function. Do not supply these controls together with an existing bootstrap result. Explicit bootstrap controls without \code{se.fit=TRUE} or \code{interval="confidence"} are errors. A pure point-prediction call draws no random numbers. \paragraph{\code{na.action}.} Applies to \code{newdata}, not to the already fitted sample. The default \code{na.pass} keeps positions corresponding to missing predictors and reports \code{NA} predictions/SEs there. \code{na.omit} removes incomplete rows. \code{na.exclude} removes them for matrix construction and reinserts their missing positions in the returned prediction and SE objects. \code{na.fail} stops. Infinite transformed design values are rejected. Empty \code{newdata}, or omission of all prediction rows, returns a length-zero point vector or a zero-row confidence-interval matrix with columns \code{fit}, \code{lwr} and \code{upr}. With \code{se.fit=TRUE}, the standard-error vector has matching length. \code{na.exclude} restores \code{NA} positions, including when all prediction rows were missing. \paragraph{\code{...}.} Extra \code{bboot.gir()} controls for an automatic bootstrap only, for example \code{cluster} and \code{cluster_order}, or setting \code{first_stage_boot} to \code{"fixed"} for a known nuisance. Cluster vectors describe the original fitting data or estimation sample, never \code{newdata}. These controls are not \code{gir()} options and cannot change the point fit. With an existing bootstrap, extra controls are rejected. A simple prediction needs none of them. \subsection{Prediction standard errors and intervals} For a row vector \(x'\), define the bootstrap predictions \[ \widehat G^{*(b)}(x)=x'\widehat\theta^{*(b)}. \] Their sample standard deviation is, up to floating-point arithmetic, \[ \boxed{\widehat{\mathrm{se}}\{\widehat G(x)\} =\sqrt{x'\widehat V_{\mathrm{boot}}x}.} \] The confidence interval follows the same basic construction as Algorithm 2, now for a fixed linear functional: \[ \boxed{\left[\widehat G(x)-q_{1-\alpha/2}^*(x),\; \widehat G(x)-q_{\alpha/2}^*(x)\right],} \] where \(q_u^*(x)\) is the type-7 quantile of \(\{x'(\widehat\theta^{*(b)}-\widehat\theta):1\leq b\leq B\}\). Coefficient estimation uncertainty from both stages is already represented in these joint draws. No OLS residual variance is added. For an intercept and one covariate, \[ \widehat{\mathrm{se}}\{\widehat G(x)\}^2 =\widehat V_{00}+2x\widehat V_{01}+x^2\widehat V_{11}. \] For example, suppose \(\widehat\theta=(0.10,0.20)'\) and \[ \widehat V=\begin{pmatrix}0.0004&-0.0001\\-0.0001&0.0009\end{pmatrix}. \] At \(x=0.5\), the fitted Gini is 0.20 and its variance estimate is \(0.0004-0.0001+0.000225=0.000525\), giving an SE of approximately 0.022913. The basic interval still requires the projected draws; this variance number alone does not determine its possibly asymmetric endpoints. Adding the marginal lower coefficient bounds to obtain a lower prediction bound is generally incorrect. Predictions use the same joint coefficient draw for all terms, preserving covariance. Computation is divided into blocks of prediction rows to avoid storing the entire newdata-by-bootstrap matrix at once. \subsection{Pointwise coverage, range and extrapolation} Each interval applies to the specified fixed covariate row. A collection of pointwise 95\% intervals is not a 95\% simultaneous band over all rows or over a continuum of \(x\). No claim of uniform coverage is made for a growing or post-selected prediction grid. Neither predictions nor confidence endpoints are clipped to \([0,1]\). Out-of-range point predictions cause a warning and remain visible. This is separate from \code{gir(clip=TRUE)}, which clips first-stage mid-CDF values. A constrained nonlinear Gini model or interval transformation would be a separate specification, not a display change. The linear index can be evaluated outside the observed covariate range, but this is extrapolation. The method does not guarantee overlap for an unobserved joint categorical profile or correctness of the linear model outside the support used for estimation. For an aliased second-stage fit, a new linear functional must lie in the estimable row space of the weighted training design. Non-estimable rows return \code{NA} with a warning. Bootstrap prediction inference nevertheless requires a full-rank coefficient specification in this implementation. Refitting the same identified model without redundant columns is preferable to obtaining coefficient uncertainty for an arbitrary alias convention. \section{Complete worked examples} \label{sec:worked} \subsection{Generate data from the paper's continuous-binary design} The following is a self-contained setup using base R. It draws one dataset from the paper's simulation design with one continuous and two binary regressors. \begin{lstlisting} library(GIR) set.seed(150L) n <- 2000L x1 <- runif(n, 0.1, 1) x2 <- rbinom(n, 1L, 0.5) x3 <- rbinom(n, 1L, 0.5) m <- 0.075*x1 + 0.100*x2 + 0.125*x3 alpha <- (1 - m) / (2*m) y <- rbeta(n, shape1 = alpha, shape2 = 1) dat <- data.frame(y = y, x1 = x1, x2 = x2, x3 = x3) \end{lstlisting} The true coefficient vector is \((0.075,0.100,0.125)'\), with no second-stage intercept. The true conditional CDF and mid-CDF coincide because the response law is continuous: \(M(y\mid x)=y^{\alpha(x)}\) on \([0,1]\). \subsection{Fit and bootstrap the spline specification} \begin{lstlisting} fit <- gir( y ~ 0 + x1 + x2 + x3, data = dat, first_stage = ~ x1 + x2 + x3, continuous = "x1", discrete = c("x2", "x3"), basis = "spline", spline_order = 4L, kappa = 0.300, basis_constant = 1, sieve_size_type = "knots", sieve_size_reference = "cell", basis_bounds = list(x1 = c(0.1, 1)), clip = FALSE, first_stage_singular = "ridge", first_stage_tol = 1e-12, ridge = 1e-10, singular.ok = FALSE ) bb <- bboot.gir(fit, R = 999L, level = 0.95, seed = 42L) summary(fit) # point-estimator summary summary(bb) # bootstrap inference summary coef(bb) # same point coefficients as coef(fit) confint(bb) # Algorithm 2 intervals bb$std.error vcov(bb) bb$bias bb$diagnostics fit$first_stage$diagnostics$marginal_dimensions fit$first_stage$diagnostics$marginal_knot_counts \end{lstlisting} This call selects \code{sieve_size_type = "knots"} explicitly, so that \(\lfloor n_g^{0.3}\rfloor\) is the number of interior knots; the package default applies the rule to the total dimension instead. With this seed, some series mid-CDF estimates fall outside \([0,1]\), so the fit and bootstrap report warnings. Inspect \code{midcdf(fit)} and \code{bb$diagnostics}. The example retains those estimates; choosing \code{clip = TRUE} would change the estimator. \subsection{The formula convenience form} \begin{lstlisting} bb_formula <- bboot.gir( y ~ 0 + x1 + x2 + x3, data = dat, first_stage = ~ x1 + x2 + x3, continuous = "x1", discrete = c("x2", "x3"), basis = "spline", spline_order = 4L, sieve_size_type = "knots", sieve_size_reference = "cell", basis_bounds = list(x1 = c(0.1, 1)), first_stage_singular = "ridge", singular.ok = FALSE, R = 999L, level = 0.95, seed = 42L ) # Same model, defaults and local seed as the preceding example. all.equal(bb$t, bb_formula$t, tolerance = 1e-12) \end{lstlisting} The fitted-object form is shorter and more resistant to accidentally changing an option between estimation and inference. \subsection{Contrasts, Gini points and a coefficient ratio} \begin{lstlisting} # Difference between two coefficients: H0 theta_x2 - theta_x3 = 0. s_diff <- summary(bb, transform = c(x2 = 1, x3 = -1), null = 0) s_diff$test$table s_diff$test$conf.int # Express the x2 coefficient in Gini points (100 times the index). s_points <- summary(bb, transform = c(x2 = 100), null = 0) s_points$test$table # Nonlinear example; appropriate only for a well-separated nonzero denominator. ratio <- function(b) c(ratio = unname(b["x2"] / b["x3"])) s_ratio <- summary(bb, transform = ratio, null = 1) s_ratio$test$table \end{lstlisting} These calls reuse the same raw draws. They do not require an analytic derivative from the user, but smoothness and nondegeneracy are still assumptions. A ratio interval can be unreliable near a zero denominator even when no numeric error is raised. \subsection{Joint and directional tests} \begin{lstlisting} # Nonredundant joint restrictions: H0 theta_x2 = theta_x3 = 0. selected <- function(b) b[c("x2", "x3")] s_joint <- summary(bb, transform = selected, null = c(x2 = 0, x3 = 0), joint = TRUE) s_joint$test$joint # Directional marginal alternative: theta_x2 > 0. s_greater <- summary(bb, transform = c(x2 = 1), null = 0, alternative = "greater") s_greater$test$p.value \end{lstlisting} The reported confidence intervals remain two-sided; only the test changes with \code{alternative}. The joint test above tests the vector of two restrictions and is not equivalent to requiring that both marginal p-values fall below the same significance level. \subsection{Newdata predictions with a reusable bootstrap} \begin{lstlisting} newdat <- data.frame( x1 = c(0.2, 0.5, 0.8), x2 = c(0, 1, 1), x3 = c(0, 0, 1) ) predict(fit, newdata = newdat) predict(fit) # identical to fitted(fit) pred <- predict(fit, newdata = newdat, interval = "confidence", se.fit = TRUE, level = 0.95, bootstrap = bb) pred$fit pred$se.fit # Reuse the same coefficient draws at another level. predict(fit, newdata = newdat, interval = "confidence", level = 0.90, bootstrap = bb) \end{lstlisting} This gives conditional Gini predictions for the listed profiles, not predicted wages or incomes. No outcome column is required in \code{newdat}. \subsection{Automatic bootstrap inside prediction} \begin{lstlisting} predict(fit, newdata = newdat, se.fit = TRUE, interval = "confidence", R = 999L, seed = 42L) \end{lstlisting} This is convenient for one prediction request. For multiple requests, obtaining \code{bb <- bboot.gir(fit, ...)} once and reusing it avoids repeated fitting and makes comparisons share the same bootstrap randomness. \subsection{A difference in predicted Gini indices} For two fixed profiles \(x_A,x_B\), the difference is \((x_A-x_B)'\theta\). In the no-intercept worked model: \begin{lstlisting} contrast_AB <- c(x1 = 0.8 - 0.2, x2 = 1 - 0, x3 = 1 - 0) s_AB <- summary(bb, transform = contrast_AB, null = 0) s_AB$test$table \end{lstlisting} Do not subtract the two separately computed prediction interval endpoints. The contrast calculation retains their dependence through the common coefficient draws. For a model with interactions, construct \(x_A-x_B\) from its full second-stage model-matrix rows, not merely differences of raw data columns. \subsection{Supplied multipliers and exact reuse across bases} \begin{lstlisting} # Draw a single vector once, after generating one simulated dataset. e <- rexp(nobs(fit), rate = 1) w_star <- e / mean(e) one_spline <- bboot.gir( fit, R = 1L, inference = FALSE, bootstrap_weights = w_star, normalize_weights = FALSE ) one_spline$t[1L, ] fit_legendre <- gir( y ~ 0 + x1 + x2 + x3, data = dat, continuous = "x1", discrete = c("x2", "x3"), basis = "legendre", kappa = 0.245, sieve_size_type = "dimension", sieve_size_reference = "cell", basis_bounds = list(x1 = c(0.1, 1)), first_stage_singular = "ridge", first_stage_tol = 1e-12, ridge = 1e-10, singular.ok = FALSE ) one_legendre <- bboot.gir( fit_legendre, R = 1L, inference = FALSE, bootstrap_weights = w_star, normalize_weights = FALSE ) \end{lstlisting} Calling each basis variant with independently generated weights would not give paired bootstrap draws. \subsection{The oracle first stage} \begin{lstlisting} dat$oracle_midcdf <- dat$y^alpha fit_oracle <- gir(y ~ 0 + x1 + x2 + x3, data = dat, midcdf = oracle_midcdf, singular.ok = FALSE) one_oracle <- bboot.gir( fit_oracle, R = 1L, inference = FALSE, first_stage_boot = "fixed", bootstrap_weights = w_star, normalize_weights = FALSE ) \end{lstlisting} This is the oracle calculation of the paper's simulations: the true conditional CDF is held fixed. It does not justify holding a data-estimated mid-CDF fixed in an empirical analysis. \subsection{A complete external first-stage callback example} Here a single unconditional mid-distribution is intentionally supplied to an intercept-only model. The callback re-estimates that same object under the combined weights, using an explicit loop only for clarity: \begin{lstlisting} small <- data.frame(y = c(0, 1, 1, 2, 2, 3, 4, 5)) weighted_mid <- function(y, a) { vapply(y, function(yi) { sum(a * ((y < yi) + 0.5*(y == yi))) / sum(a) }, numeric(1)) } small$m <- weighted_mid(small$y, rep(1, nrow(small))) external_fit <- gir(y ~ 1, data = small, midcdf = m) refit_external <- function(object, weights, replicate) { weighted_mid(object$estimation$y, weights) } external_bb <- bboot.gir(external_fit, R = 999L, seed = 8L, midcdf_boot = refit_external) summary(external_bb) \end{lstlisting} The callback uses the actual retained sample, not a separately cleaned data vector. A general external conditional estimator needs its own weighted refitting implementation; the simple loop above is not a replacement for it. \subsection{Missing prediction values} \begin{lstlisting} nd_na <- newdat nd_na$x1[2L] <- NA_real_ predict(fit, nd_na) # middle entry is NA predict(fit, nd_na, na.action = na.omit) # two entries predict(fit, nd_na, na.action = na.exclude) # three entries, middle NA # predict(fit, nd_na, na.action = na.fail) # intentional error \end{lstlisting} For uncertainty, the same row policy applies to the interval matrix and SEs. \section{Relation to existing R interfaces} \paragraph{\code{quantreg::boot.rq}.} The documented function is a lower-level regression bootstrap engine taking \code{x}, \code{y}, \code{tau}, and \code{R}, with a matrix of coefficient draws returned for subsequent analysis. Its \code{bsmethod="wxy"} uses unit exponential weights \cite{bootrq}. The GIR package retains the regression-specific resampling logic, replicate count, and access to raw draws, but accepts a fitted model to preserve the two-stage specification. It adds the paper's basic intervals and an explicit smooth-transformation/test interface. It does not call a quantile regression engine or import \code{quantreg} at runtime. \paragraph{\code{boot::boot}.} The generic \code{boot()} interface takes data and a statistic and can pass extra arguments through \code{...}; its familiar \code{t0}/\code{t}/\code{R} layout motivates the output of \code{bboot.gir()} \cite{bootmanual}. However, \code{stype="w"} only tells \code{boot()} that a statistic's second argument represents weights. It does not, by itself, request iid exponential Bayesian multipliers. A generic wrapper is possible, but the dedicated engine makes the required weight law, common two-stage weighting, fixed basis, tie handling, and cached calculation explicit. The class returned by \code{bboot.gir()} is not a \code{boot} object, and \code{boot.ci()} is not the supported extraction method. \paragraph{\code{predict.rq} and \code{predict.lm}.} The fitted-object/newdata design, \code{interval}, \code{level}, and \code{na.action} choices follow familiar regression conventions; the \code{se.fit} list form is especially close to \code{predict.lm} \cite{predictrq,predictlm}. The statistical target and uncertainty calculation differ. \code{predict.rq} has several interval approaches, including percentile bootstrap prediction-function intervals, whereas this version of the GIR package implements only Algorithm 2's basic logic. Unlike \code{predict.lm}, \code{predict.gir()} does not add an individual-outcome noise term or provide a residual scale and Student degrees of freedom. There is only one prediction scale here: the linear Gini index. \section{Using the package in a Monte Carlo study} \label{sec:validation} \subsection{Three different quantities called standard deviation or bias} For a real dataset, \code{bb$std.error} estimates sampling uncertainty from many bootstrap draws conditional on that dataset. Its \code{bias} is the bootstrap mean minus the fitted coefficient. Across Monte Carlo datasets, a simulation study instead computes \[ \widehat{\mathrm{Bias}}_{\mathrm{MC}} =\frac1S\sum_{r=1}^S\widehat\theta^{(r)}-\theta_0, \quad \widehat{\mathrm{SD}}_{\mathrm{MC},j} =\left\{\frac1{S-1}\sum_{r=1}^S (\widehat\theta_j^{(r)}-\bar\theta_j)^2\right\}^{1/2}. \] These are not \code{bb$bias} or a within-dataset bootstrap SE; each quantity should be compared with its own counterpart. \subsection{Warp-speed coverage} The warp-speed method \cite{gpw} uses one bootstrap draw per Monte Carlo dataset and pools \[ \Delta_{rj}=\widehat\theta_j^{*(r)}-\widehat\theta_j^{(r)} \quad(r=1,\ldots,S). \] Let \(q_j^-\) and \(q_j^+\) be the pooled type-7 quantiles at \(\alpha/2\) and \(1-\alpha/2\). The dataset-specific intervals are \[ [\widehat\theta_j^{(r)}-q_j^+,\; \widehat\theta_j^{(r)}-q_j^-], \] and coverage is the fraction containing the known truth. This pooling is distinct from the many-draw conditional bootstrap of Algorithm 2. In such a study, obtain each dataset's point estimate with \code{gir()} and its single draw with \code{bboot.gir()} using \code{R=1} and \code{inference=FALSE}. When several estimators are compared on the same dataset, supply the same multiplier vector to each of them through \code{bootstrap_weights}, so that their draws are paired. Running \(B=999\) draws inside every Monte Carlo dataset is a different experiment. For already assembled \(S\times p\) matrices \code{theta_hat} and \code{theta_star}, the aggregation is: \begin{lstlisting} alpha_level <- 1 - confidence_level delta <- theta_star - theta_hat q_lo <- apply(delta, 2L, quantile, probs = alpha_level/2, names = FALSE, type = 7L) q_hi <- apply(delta, 2L, quantile, probs = 1-alpha_level/2, names = FALSE, type = 7L) ci_lo <- sweep(theta_hat, 2L, q_hi, "-") ci_hi <- sweep(theta_hat, 2L, q_lo, "-") truth <- matrix(rep(true_theta, each = nrow(theta_hat)), nrow = nrow(theta_hat)) coverage <- colMeans(ci_lo <= truth & truth <= ci_hi) mc_bias <- colMeans(theta_hat) - true_theta mc_sd <- apply(theta_hat, 2L, sd) \end{lstlisting} \section{Mathematical validation} The source tests include independent finite-sample checks tied to the paper: \begin{itemize}[leftmargin=2em] \item \code{test-math-algorithms.R} implements Algorithms 1 and 2 directly with QR-based threshold regressions. It checks full-rank Legendre and spline tensor bases, unequal discrete cells, ties and zeros, and paired bootstrap refits using the same multipliers in both stages. \item \code{test-math-gini-identity.R} checks Numerical Equivalence using pairwise absolute differences. It verifies the empirical group Gini, without the optional finite-sample correction, and its weighted counterpart in saturated bootstrap draws. \item \code{test-math-invariance.R} checks Scale Invariance for positive outcome rescaling, and row-order invariance when multiplier rows move with the observations. Coefficients, predictions, goodness of fit and paired bootstrap inference are compared. \item \code{test-math-r-squared.R} checks Algorithm 3, the weighted variation decomposition, and nested second-stage comparisons with the first stage held fixed. Zero benchmark variation is undefined; a model without an intercept can have negative GIR-$R^2$. \end{itemize} These fixtures use no ridge or clipping and run without network access or the draft paper. The inference arithmetic checks use 40 deterministic multiplier columns and confidence level 0.5; this is a small software test, not a coverage experiment or an applied-inference recommendation. General comparisons use tolerance \(10^{-10}\), and small pairwise identities use \(10^{-12}\). The reference calculations do not call GIR's internal basis or fitting helpers. The separate cluster and ridge tests verify implementation extensions without establishing their theoretical validity. From the source directory, run \code{testthat::test_local(filter="math-")} for these checks, or \code{testthat::test_local()} for the full suite. They also run under \code{R CMD check}. The installed help topic \code{help("GIR-validation", package="GIR")} provides the detailed mapping and qualifications. Passing the tests does not prove asymptotic results or nominal confidence-interval coverage; the simulation framework above is a separate validation exercise. Additional checks in \code{test-empty-samples.R} cover empty samples, retained weights, custom missing-value actions, alignment and omission metadata, and empty prediction/interval shapes. The point-estimator and bootstrap tests check the complete set of expected warnings and require other calls to run without warnings. Run \code{testthat::test_local(filter="empty-samples")} to isolate the sample-handling tests. \section{Installation and development} Before the first CRAN release, installation from GitHub requires access to the private repository: \begin{lstlisting} # install.packages("remotes") remotes::install_github("uptoaparameter/GIR", build_vignettes = TRUE) library(GIR) ?gir ?bboot.gir ?predict.gir \end{lstlisting} The help files in \code{man/} are generated from the roxygen comments in \code{R/}; after editing those comments, run \code{roxygen2::roxygenize()} in the package directory. Run \code{testthat::test_local()} for the tests. Full release checks build the source package and run \code{R CMD check --as-cran}, including this vignette and the function reference. Maintainer instructions are in \code{tools/README.md} in the repository. Open the installed guide with \code{vignette("GIR-guide", package = "GIR")} and obtain the package and paper citations with \code{citation("GIR")}. The fit and bootstrap objects retain resolved estimation data, even when \code{model=FALSE}, \code{x=FALSE}, and \code{y=FALSE} omit corresponding public slots. Those flags do not anonymize an object or remove its internal snapshot. Do not publish fitted objects containing confidential data without a separate review of their contents. \section{Current limitations} \begin{itemize}[leftmargin=2em] \item Bootstrap inference uses iid or cluster-level exponential multipliers; no complex-survey or time-series resampling scheme is implemented, and the paper's theorem covers the iid case. \item Prediction intervals are pointwise confidence intervals for the linear Gini index, not individual-outcome intervals or simultaneous bands. \item Bootstrap coefficient and prediction inference require a full-rank second-stage specification. Nonregular transformations require separate methods; a numerical result alone does not establish validity. \item The paper's weak-convergence proof is not itself a proof of bootstrap variance moment consistency. Covariance-based inference requires the additional regularity explained above. \item Numerical clipping, regularization, and external first-stage methods do not automatically inherit the unmodified series estimator's theory. \item Full tensor products can become large when the number of continuous regressors increases. \item Discrete conditioning is fully saturated through joint cells, which can create sparse groups when many discrete variables or levels are used. \item Interior spline knots are currently equally spaced on the normalized support; custom or quantile-spaced knot locations are not yet exposed. \item The first-stage fitted function is not constrained to be monotone in the outcome threshold or to lie in \([0,1]\), except for optional pointwise clipping at the observed evaluation pairs. \end{itemize} \section{References} \begingroup \renewcommand{\section}[2]{} \begin{thebibliography}{99} \bibitem{girpaper} Bhardwaj, V. and D\'iaz-Villarejo, D. (2026). \newblock \emph{Gini Index Regression}. \newblock Working paper, Universidad Carlos III de Madrid. \newblock \url{https://ddiazvil.com/assets/papers/JMP_GIR_DiazVillarejo.pdf}. \bibitem{gpw} Giacomini, R., Politis, D. N. and White, H. (2013). \newblock A warp-speed method for conducting Monte Carlo experiments involving bootstrap estimators. \newblock \emph{Econometric Theory}, 29(3), 567--589. \bibitem{rbs} R Core Team. \newblock \emph{B-Spline Basis for Polynomial Splines: \code{splines::bs}}. \newblock R documentation for the recommended \code{splines} package. \bibitem{bootrq} Koenker, R. and contributors. \newblock \emph{Bootstrapping Quantile Regression: \code{boot.rq}}. \newblock R documentation for \code{quantreg}. \newblock \url{https://CRAN.R-project.org/package=quantreg}. \bibitem{predictrq} Koenker, R. and contributors. \newblock \emph{Quantile Regression Prediction: \code{predict.rq}}. \newblock R documentation for \code{quantreg}. \newblock \url{https://CRAN.R-project.org/package=quantreg}. \bibitem{bootmanual} Canty, A., Ripley, B. and contributors. \newblock \emph{Bootstrap Resampling: \code{boot}}; and \emph{Print a Summary of a Bootstrap Object: \code{print.boot}}. \newblock Official R documentation for the recommended \code{boot} package. \newblock \url{https://stat.ethz.ch/R-manual/R-devel/library/boot/html/boot.html}. \bibitem{predictlm} R Core Team. \newblock \emph{Predict Method for Linear Model Fits: \code{predict.lm}}. \newblock Official R documentation. \newblock \url{https://stat.ethz.ch/R-manual/R-devel/library/stats/html/predict.lm.html}. \bibitem{cheng} Cheng, G. (2014, revised preprint). \newblock \emph{Moment Consistency of the Exchangeably Weighted Bootstrap for Semiparametric M-Estimation}. \newblock arXiv:1109.4204v2. \newblock \url{https://arxiv.org/abs/1109.4204}. \end{thebibliography} \endgroup \section{See also} Related infrastructure and interfaces: \code{lm()}, \code{model.frame()}, \code{model.matrix()}, \code{splines::bs()}, \code{boot::boot()}, \code{quantreg::boot.rq()}, \code{quantreg::predict.rq()}, and \code{stats::predict.lm()}. These comparisons do not add runtime dependencies on \code{boot} or \code{quantreg}. \end{document}