Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Yanyan Liu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Lican Kang

> Home > Persons > Yanyan Liu

Publications

2022
[j82]
- view
  authority control:
- export record
  dblp key:
  - journals/cstat/HuangJKLLL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cstat/HuangJKLLL22
Jian Huang, Yuling Jiao, Lican Kang, Jin Liu, Yanyan Liu, Xiliang Lu:
GSDAR: a fast Newton algorithm for ℓ ₀ regularized generalized linear models with statistical guarantee. Comput. Stat. 37(1): 507-533 (2022)
2021
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2107-04766
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2107-04766
Yuling Jiao, Lican Kang, Yanyan Liu, Youzhou Zhou:
Convergence Analysis of Schr{ö}dinger-F{ö}llmer Sampler without Convexity. CoRR abs/2107.04766 (2021)
2020
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2001-05819
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2001-05819
Jian Huang, Yuling Jiao, Lican Kang, Jin Liu, Yanyan Liu, Xiliang Lu:
A Support Detection and Root Finding Approach for Learning High-dimensional Generalized Linear Models. CoRR abs/2001.05819 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.