<?xml version="1.0" encoding="utf-8" ?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:r="https://r-universe.dev"><channel><title>erikcs.r-universe.dev</title><link>https://erikcs.r-universe.dev</link><description>Recent package updates in erikcs</description><generator>R-universe</generator><image><url>https://github.com/erikcs.png</url><title>R packages by erikcs</title><link>https://erikcs.r-universe.dev</link></image><lastBuildDate>Sun, 23 Aug 2026 10:10:23 GMT</lastBuildDate><item><title>[erikcs] balnet 0.0.4</title><author>erik.sverdrup@gmail.com (Erik Sverdrup)</author><description>Provides pathwise estimation of regularized logistic
propensity score models using covariate balancing loss
functions rather than maximum likelihood. Regularization paths
are fit via the 'adelie' elastic-net solver with a
'glmnet'-like interface, yielding balancing weights that target
covariate balance for the ATE and ATT. Under lasso
penalization, lambda bounds the maximum covariate imbalance, so
the regularization path traces a sequence of decreasing
imbalance tolerances. For details, see Sverdrup &amp; Hastie (2026)
&lt;doi:10.48550/arXiv.2602.18577&gt;.</description><link>https://github.com/r-universe/erikcs/actions/runs/35841953808</link><pubDate>Sun, 23 Aug 2026 10:10:23 GMT</pubDate><r:package>balnet</r:package><r:version>0.0.4</r:version><r:status>success</r:status><r:repository>https://erikcs.r-universe.dev</r:repository><r:upstream>https://github.com/cran/balnet</r:upstream><r:article><r:source>balnet.Rmd</r:source><r:filename>balnet.html</r:filename><r:title>An introduction to balnet</r:title><r:created>2026-04-03 10:06:32</r:created><r:modified>2026-05-05 00:12:02</r:modified></r:article></item><item><title>[erikcs] maq 0.6.1</title><author>erik.sverdrup@gmail.com (Erik Sverdrup)</author><description>Fits generalized Qini curves for evaluating treatment
allocation policies with one or more mutually exclusive
treatment arms. Given estimated conditional treatment effects
and treatment costs, 'maq' computes the optimal treatment
allocation over a range of budget levels and estimates the
resulting policy value using doubly robust or
inverse-propensity weighted scores. The underlying optimization
exploits the linear multiple-choice knapsack structure of the
allocation problem to compute the full solution path
efficiently. For details see Sverdrup, Wu, Athey, and Wager
(2025) &lt;doi:10.1080/10618600.2024.2418820&gt;.</description><link>https://github.com/r-universe/erikcs/actions/runs/37193130845</link><pubDate>Tue, 04 Aug 2026 13:10:17 GMT</pubDate><r:package>maq</r:package><r:version>0.6.1</r:version><r:status>success</r:status><r:repository>https://erikcs.r-universe.dev</r:repository><r:upstream>https://github.com/cran/maq</r:upstream></item><item><title>[erikcs] policytree 1.2.5</title><author>erik.sverdrup@gmail.com (Erik Sverdrup)</author><description>Learn optimal policies via doubly robust empirical welfare
maximization over trees. Given reward estimates, the algorithm
finds a rule-based treatment allocation, where the policy takes
the form of a shallow decision tree that is globally optimal
(or nearly so). Methods are described in Sverdrup, Kanodia,
Zhou, Athey, and Wager (2020) &lt;doi:10.21105/joss.02232&gt;, Athey
and Wager (2021) &lt;doi:10.3982/ECTA15732&gt;, and Zhou, Athey, and
Wager (2023) &lt;doi:10.1287/opre.2022.2271&gt;.</description><link>https://github.com/r-universe/erikcs/actions/runs/37193190778</link><pubDate>Tue, 04 Aug 2026 10:30:29 GMT</pubDate><r:package>policytree</r:package><r:version>1.2.5</r:version><r:status>success</r:status><r:repository>https://erikcs.r-universe.dev</r:repository><r:upstream>https://github.com/cran/policytree</r:upstream></item></channel></rss>