<?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>wzjwangzhijing.r-universe.dev</title><link>https://wzjwangzhijing.r-universe.dev</link><description>Recent package updates in wzjwangzhijing</description><generator>R-universe</generator><image><url>https://github.com/wzjwangzhijing.png</url><title>R packages by wzjwangzhijing</title><link>https://wzjwangzhijing.r-universe.dev</link></image><lastBuildDate>Thu, 08 Jan 2026 04:52:07 GMT</lastBuildDate><item><title>[zjwangatsu] transGFM 1.0.2</title><author>wangzhijing@sjtu.edu.cn (Zhijing Wang)</author><description>Transfer learning for generalized factor models with
support for continuous, count (Poisson), and binary data types.
The package provides functions for single and multiple source
transfer learning, source detection to identify positive and
negative transfer sources, factor decomposition using Maximum
Likelihood Estimation (MLE), and information criteria ('IC1'
and 'IC2') for rank selection. The methods are particularly
useful for high-dimensional data analysis where auxiliary
information from related source datasets can improve estimation
efficiency in the target domain.</description><link>https://github.com/r-universe/zjwangatsu/actions/runs/27124323329</link><pubDate>Thu, 08 Jan 2026 04:52:07 GMT</pubDate><r:package>transGFM</r:package><r:version>1.0.2</r:version><r:status>success</r:status><r:repository>https://zjwangatsu.r-universe.dev</r:repository><r:upstream>https://github.com/zjwangatsu/transgfm</r:upstream></item><item><title>[zjwang1013] sparseGFM 0.1.0</title><author>wangzhijing@sjtu.edu.cn (Zhijing Wang)</author><description>Implements sparse generalized factor models (sparseGFM)
for dimension reduction and variable selection in
high-dimensional data with automatic adaptation to weak factor
scenarios. The package supports multiple data types
(continuous, count, binary) through generalized linear model
frameworks and handles missing values automatically. It
provides 12 different penalty functions including Least
Absolute Shrinkage and Selection Operator (Lasso), adaptive
Lasso, Smoothly Clipped Absolute Deviation (SCAD), Minimax
Concave Penalty (MCP), group Lasso, and their adaptive versions
for inducing row-wise sparsity in factor loadings. Key features
include cross-validation for regularization parameter selection
using Sparsity Information Criterion (SIC), automatic
determination of the number of factors via multiple information
criteria, and specialized algorithms for row-sparse loading
structures. The methodology employs alternating minimization
with Singular Value Decomposition (SVD)-based identifiability
constraints and is particularly effective for high-dimensional
applications in genomics, economics, and social sciences where
interpretable sparse dimension reduction is crucial. For
penalty functions, see Tibshirani (1996)
&lt;doi:10.1111/j.2517-6161.1996.tb02080.x&gt;, Fan and Li (2001)
&lt;doi:10.1198/016214501753382273&gt;, and Zhang (2010)
&lt;doi:10.1214/09-AOS729&gt;.</description><link>https://github.com/r-universe/zjwang1013/actions/runs/25780619052</link><pubDate>Mon, 15 Sep 2025 01:56:10 GMT</pubDate><r:package>sparseGFM</r:package><r:version>0.1.0</r:version><r:status>success</r:status><r:repository>https://zjwang1013.r-universe.dev</r:repository><r:upstream>https://github.com/zjwang1013/sparsegfm</r:upstream></item><item><title>[wzjwangzhijing] pECV 1.0.1</title><author>wangzhijing@sjtu.edu.cn (Zhijing Wang)</author><description>Implements entrywise splitting cross-validation (ECV) and
its penalized variant (pECV) for selecting the number of
factors in generalized factor models.</description><link>https://github.com/r-universe/wzjwangzhijing/actions/runs/26439843117</link><pubDate>Thu, 28 Aug 2025 08:50:07 GMT</pubDate><r:package>pECV</r:package><r:version>1.0.1</r:version><r:status>success</r:status><r:repository>https://wzjwangzhijing.r-universe.dev</r:repository><r:upstream>https://github.com/cran/pECV</r:upstream></item></channel></rss>