Jinyuan Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jinyuan Chang has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Qiwei Yao
Department of Statistics, London School of Economics
14 shared publications - Cheng Yong Tang
Department of Statistics, Operations, and Data Science Temple University
5 shared publications - Wen-Xin Zhou
College of Business Administration, University of Illinois Chicago, Chicago, Illinois 60607
5 shared publications - Tianrui Li
School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China
4 shared publications - Yanyong Huang
Southwestern University of Finance and Economics
4 shared publications Jing He
Institute of Statistical Interdisciplinary Research, Southwestern University of Finance and Economics
3 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7157-7165
TRUST-FS: Tensorized Reliable Unsupervised Multi-View Feature Selection for Incomplete Data
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7157-7165
Open AccessTRUST-FS: Tensorized Reliable Unsupervised Multi-View Feature Selection for Incomplete Data
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7598-7609
Joint Learning of Unsupervised Multi-View Feature and Instance Co-Selection With Cross-View Imputation
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (11) , 7598-7609
Joint Learning of Unsupervised Multi-View Feature and Instance Co-Selection With Cross-View Imputation
- 21 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
Feature-Rich, Data-Private: A Sparse Learning Framework for the High-Dimensional Newsvendor
Modern firms increasingly rely on high-dimensional data to improve inventory decisions, but extracting useful signals from large numbers of features while protecting sensitive data remains challenging. In their paper, “Feature-Rich, Data-Private: A Sparse Learning Framework for the High-Dimensional Newsvendor,” Chang et al. develop a framework for the feature-based newsvendor problem that addresses both challenges. Their approach combines sparse learning with differential privacy, enabling firms to focus on the demand drivers that matter while safeguarding sensitive information. The authors establish theoretical guarantees showing that the method’s performance depends primarily on the number of relevant features, with only logarithmic dependence on the overall feature dimension. This result supports the use of rich contextual information while sharply limiting the usual dimensionality penalty. Simulation studies and an application to a real-world grocery retail data set further demonstrate the practical value of combining rigorous privacy protection with data-driven inventory optimization.
- 21 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
Feature-Rich, Data-Private: A Sparse Learning Framework for the High-Dimensional Newsvendor
Modern firms increasingly rely on high-dimensional data to improve inventory decisions, but extracting useful signals from large numbers of features while protecting sensitive data remains challenging. In their paper, “Feature-Rich, Data-Private: A Sparse Learning Framework for the High-Dimensional Newsvendor,” Chang et al. develop a framework for the feature-based newsvendor problem that addresses both challenges. Their approach combines sparse learning with differential privacy, enabling firms to focus on the demand drivers that matter while safeguarding sensitive information. The authors establish theoretical guarantees showing that the method’s performance depends primarily on the number of relevant features, with only logarithmic dependence on the overall feature dimension. This result supports the use of rich contextual information while sharply limiting the usual dimensionality penalty. Simulation studies and an application to a real-world grocery retail data set further demonstrate the practical value of combining rigorous privacy protection with data-driven inventory optimization.
- 4 June 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-14
Adapting to Noise Tails in Private Linear Regression
1 IntroductionThe increasing demand for privacy-preserving statistical methods has brought differential privacy (Dwork et al., 2006) to the forefront of statistical research. Informally, a differen...
- 4 June 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-14
Adapting to Noise Tails in Private Linear Regression
1 IntroductionThe increasing demand for privacy-preserving statistical methods has brought differential privacy (Dwork et al., 2006) to the forefront of statistical research. Informally, a differen...
- Open Access
- 4 June 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-15
Testing Independence and Conditional Independence in High Dimensions via Coordinatewise Gaussianization
- 4 June 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-15
Open AccessTesting Independence and Conditional Independence in High Dimensions via Coordinatewise Gaussianization
- 1 June 2026
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 54 (3) , 1372-1397
Identification and estimation for matrix time-series CP-factor models
We propose a new method for identifying and estimating the CP-factor models for matrix time series. Unlike the generalized eigenanalysis-based method (J. R. Stat. Soc. Ser. B. Stat. Methodol. 85 (2023) 127–148) for which the convergence rates of the associated estimators may suffer from small eigengaps as the asymptotic theory is based on some matrix perturbation analysis, the proposed new method enjoys faster convergence rates which are free from any eigengaps. It achieves this by turning the problem into a joint diagonalization of several matrices whose elements are determined by a basis of a linear system, and by choosing the basis carefully to avoid near colinearity (see Proposition 5 and Section 4.3). Furthermore, unlike the generalized eigenanalysis-based method which requires the two factor loading matrices to be full-ranked, the proposed new method can handle rank-deficient factor loading matrices. Illustration with both simulated and real matrix time-series data shows the advantages of the proposed new method.
- 1 June 2026
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 54 (3) , 1372-1397
Identification and estimation for matrix time-series CP-factor models
We propose a new method for identifying and estimating the CP-factor models for matrix time series. Unlike the generalized eigenanalysis-based method (J. R. Stat. Soc. Ser. B. Stat. Methodol. 85 (2023) 127–148) for which the convergence rates of the associated estimators may suffer from small eigengaps as the asymptotic theory is based on some matrix perturbation analysis, the proposed new method enjoys faster convergence rates which are free from any eigengaps. It achieves this by turning the problem into a joint diagonalization of several matrices whose elements are determined by a basis of a linear system, and by choosing the basis carefully to avoid near colinearity (see Proposition 5 and Section 4.3). Furthermore, unlike the generalized eigenanalysis-based method which requires the two factor loading matrices to be full-ranked, the proposed new method can handle rank-deficient factor loading matrices. Illustration with both simulated and real matrix time-series data shows the advantages of the proposed new method.
- Open Access
- 16 April 2026
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 88 (5) , 1599-1618
Autoregressive networks with dependent edges
We propose an autoregressive framework for modelling dynamic networks with dependent edges. It encompasses models that accommodate, for example, transitivity, degree heterogenenity, and other stylized features often observed in real network data. By assuming the edges of networks at each time are independent conditionally on their lagged values, the models, which exhibit a close connection with temporal exponential random graph models, facilitate both simulation and the maximum likelihood estimation (MLE) in a straightforward manner. Due to the possibly large number of parameters in the models, the natural MLEs may suffer from slow convergence rates. An improved estimator for each component parameter is proposed based on an iteration employing projection, which mitigates the impact of the other parameters. Leveraging a martingale difference structure, the asymptotic distribution of the improved estimator is derived without the assumption of stationarity. The limiting distribution is not normal in general, although it reduces to normal when the underlying process satisfies some mixing conditions. Illustration with a transitivity model was carried out in both simulation and a real network data set.
- 16 April 2026
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 88 (5) , 1599-1618
Open AccessAutoregressive networks with dependent edges
We propose an autoregressive framework for modelling dynamic networks with dependent edges. It encompasses models that accommodate, for example, transitivity, degree heterogenenity, and other stylized features often observed in real network data. By assuming the edges of networks at each time are independent conditionally on their lagged values, the models, which exhibit a close connection with temporal exponential random graph models, facilitate both simulation and the maximum likelihood estimation (MLE) in a straightforward manner. Due to the possibly large number of parameters in the models, the natural MLEs may suffer from slow convergence rates. An improved estimator for each component parameter is proposed based on an iteration employing projection, which mitigates the impact of the other parameters. Leveraging a martingale difference structure, the asymptotic distribution of the improved estimator is derived without the assumption of stationarity. The limiting distribution is not normal in general, although it reduces to normal when the underlying process satisfies some mixing conditions. Illustration with a transitivity model was carried out in both simulation and a real network data set.
- Open Access
Zero Variance Portfolio
When the number of assets is larger than the sample size, the minimum variance portfolio interpolates the training data, delivering pathological zero in-sample variance. We show that if the weights of the zero variance portfolio are learned by a novel ``Ridgelet'' estimator, in a new test data this portfolio enjoys out-of-sample generalizability. It exhibits the double descent phenomenon and can achieve optimal risk in the overparametrized regime when the number of assets dominates the sample size. In contrast, a ``Ridgeless'' estimator which invokes the pseudoinverse fails in-sample interpolation and diverges away from out-of-sample optimality. Extensive simulations and empirical studies demonstrate that the Ridgelet method performs competitively in high-dimensional portfolio optimization.
Open AccessZero Variance Portfolio
When the number of assets is larger than the sample size, the minimum variance portfolio interpolates the training data, delivering pathological zero in-sample variance. We show that if the weights of the zero variance portfolio are learned by a novel ``Ridgelet'' estimator, in a new test data this portfolio enjoys out-of-sample generalizability. It exhibits the double descent phenomenon and can achieve optimal risk in the overparametrized regime when the number of assets dominates the sample size. In contrast, a ``Ridgeless'' estimator which invokes the pseudoinverse fails in-sample interpolation and diverges away from out-of-sample optimality. Extensive simulations and empirical studies demonstrate that the Ridgelet method performs competitively in high-dimensional portfolio optimization.
- Open Access
Deep Bootstrap
In this work, we propose a novel deep bootstrap framework for nonparametric regression based on conditional diffusion models. Specifically, we construct a conditional diffusion model to learn the distribution of the response variable given the covariates. This model is then used to generate bootstrap samples by pairing the original covariates with newly synthesized responses. We reformulate nonparametric regression as conditional sample mean estimation, which is implemented directly via the learned conditional diffusion model. Unlike traditional bootstrap methods that decouple the estimation of the conditional distribution, sampling, and nonparametric regression, our approach integrates these components into a unified generative framework. With the expressive capacity of diffusion models, our method facilitates both efficient sampling from high-dimensional or multimodal distributions and accurate nonparametric estimation. We establish rigorous theoretical guarantees for the proposed method. In particular, we derive optimal end-to-end convergence rates in the Wasserstein distance between the learned and target conditional distributions. Building on this foundation, we further establish the convergence guarantees of the resulting bootstrap procedure. Numerical studies demonstrate the effectiveness and scalability of our approach for complex regression tasks.
Open AccessDeep Bootstrap
In this work, we propose a novel deep bootstrap framework for nonparametric regression based on conditional diffusion models. Specifically, we construct a conditional diffusion model to learn the distribution of the response variable given the covariates. This model is then used to generate bootstrap samples by pairing the original covariates with newly synthesized responses. We reformulate nonparametric regression as conditional sample mean estimation, which is implemented directly via the learned conditional diffusion model. Unlike traditional bootstrap methods that decouple the estimation of the conditional distribution, sampling, and nonparametric regression, our approach integrates these components into a unified generative framework. With the expressive capacity of diffusion models, our method facilitates both efficient sampling from high-dimensional or multimodal distributions and accurate nonparametric estimation. We establish rigorous theoretical guarantees for the proposed method. In particular, we derive optimal end-to-end convergence rates in the Wasserstein distance between the learned and target conditional distributions. Building on this foundation, we further establish the convergence guarantees of the resulting bootstrap procedure. Numerical studies demonstrate the effectiveness and scalability of our approach for complex regression tasks.
- Open Access
Joint Learning of Unsupervised Multi-view Feature and Instance Co-selection with Cross-view Imputation
Feature and instance co-selection, which aims to reduce both feature dimensionality and sample size by identifying the most informative features and instances, has attracted considerable attention in recent years. However, when dealing with unlabeled incomplete multi-view data, where some samples are missing in certain views, existing methods typically first impute the missing data and then concatenate all views into a single dataset for subsequent co-selection. Such a strategy treats co-selection and missing data imputation as two independent processes, overlooking potential interactions between them. The inter-sample relationships gleaned from co-selection can aid imputation, which in turn enhances co-selection performance. Additionally, simply merging multi-view data fails to capture the complementary information among views, ultimately limiting co-selection effectiveness. To address these issues, we propose a novel co-selection method, termed Joint learning of Unsupervised multI-view feature and instance Co-selection with cross-viEw imputation (JUICE). JUICE first reconstructs incomplete multi-view data using available observations, bringing missing data recovery and feature and instance co-selection together in a unified framework. Then, JUICE leverages cross-view neighborhood information to learn inter-sample relationships and further refine the imputation of missing values during reconstruction. This enables the selection of more representative features and instances. Extensive experiments demonstrate that JUICE outperforms state-of-the-art methods.
Open AccessJoint Learning of Unsupervised Multi-view Feature and Instance Co-selection with Cross-view Imputation
Feature and instance co-selection, which aims to reduce both feature dimensionality and sample size by identifying the most informative features and instances, has attracted considerable attention in recent years. However, when dealing with unlabeled incomplete multi-view data, where some samples are missing in certain views, existing methods typically first impute the missing data and then concatenate all views into a single dataset for subsequent co-selection. Such a strategy treats co-selection and missing data imputation as two independent processes, overlooking potential interactions between them. The inter-sample relationships gleaned from co-selection can aid imputation, which in turn enhances co-selection performance. Additionally, simply merging multi-view data fails to capture the complementary information among views, ultimately limiting co-selection effectiveness. To address these issues, we propose a novel co-selection method, termed Joint learning of Unsupervised multI-view feature and instance Co-selection with cross-viEw imputation (JUICE). JUICE first reconstructs incomplete multi-view data using available observations, bringing missing data recovery and feature and instance co-selection together in a unified framework. Then, JUICE leverages cross-view neighborhood information to learn inter-sample relationships and further refine the imputation of missing values during reconstruction. This enables the selection of more representative features and instances. Extensive experiments demonstrate that JUICE outperforms state-of-the-art methods.