---
_id: '10673'
abstract:
- lang: eng
text: We propose a neural information processing system obtained by re-purposing
the function of a biological neural circuit model to govern simulated and real-world
control tasks. Inspired by the structure of the nervous system of the soil-worm,
C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model
of biological neural circuits reparameterized for the control of alternative tasks.
We first demonstrate that ONCs realize networks with higher maximum flow compared
to arbitrary wired networks. We then learn instances of ONCs to control a series
of robotic tasks, including the autonomous parking of a real-world rover robot.
For reconfiguration of the purpose of the neural circuit, we adopt a search-based
optimization algorithm. Ordinary neural circuits perform on par and, in some cases,
significantly surpass the performance of contemporary deep learning models. ONC
networks are compact, 77% sparser than their counterpart neural controllers, and
their neural dynamics are fully interpretable at the cell-level.
acknowledgement: "RH and RG are partially supported by Horizon-2020 ECSEL Project
grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was
supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein
Award). AA is supported by the National Science Foundation (NSF) Graduate Research
Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and
JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation
of RH.\r\n"
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner:
Reinforcement learning with ordinary neural circuits. In: Proceedings of the
37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural
lottery ticket winner: Reinforcement learning with ordinary neural circuits. In
Proceedings of the 37th International Conference on Machine Learning (pp.
4082–4093). Virtual.'
chicago: 'Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary
Neural Circuits.” In Proceedings of the 37th International Conference on Machine
Learning, 4082–93. PMLR, 2020.'
ieee: 'R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery
ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings
of the 37th International Conference on Machine Learning, Virtual, 2020, pp.
4082–4093.'
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket
winner: Reinforcement learning with ordinary neural circuits. Proceedings of the
37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR,
, 4082–4093.'
mla: 'Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning
with Ordinary Neural Circuits.” Proceedings of the 37th International Conference
on Machine Learning, 2020, pp. 4082–93.'
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
37th International Conference on Machine Learning, 2020, pp. 4082–4093.
conference:
end_date: 2020-07-18
location: Virtual
name: 'ML: Machine Learning'
start_date: 2020-07-12
date_created: 2022-01-25T15:50:34Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2022-01-26T11:14:27Z
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
file:
- access_level: open_access
checksum: c9a4a29161777fc1a89ef451c040e3b1
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-26T11:08:51Z
date_updated: 2022-01-26T11:08:51Z
file_id: '10691'
file_name: 2020_PMLR_Hasani.pdf
file_size: 2329798
relation: main_file
success: 1
file_date_updated: 2022-01-26T11:08:51Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/3.0/
main_file_link:
- open_access: '1'
url: http://proceedings.mlr.press/v119/hasani20a.html
oa: 1
oa_version: Published Version
page: 4082-4093
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings of the 37th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
quality_controlled: '1'
scopus_import: '1'
series_title: PMLR
status: public
title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural
circuits'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND
3.0)
short: CC BY-NC-ND (3.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '10693'
abstract:
- lang: eng
text: High quality graphene heterostructures host an array of fractional quantum
Hall isospin ferromagnets with diverse spin and valley orders. While a variety
of phase transitions have been observed, disentangling the isospin phase diagram
of these states is hampered by the absence of direct probes of spin and valley
order. I will describe nonlocal transport measurements based on launching spin
waves from a gate defined lateral heterojunction, performed in ultra-clean Corbino
geometry graphene devices. At high magnetic fields, we find that the spin-wave
transport signal is detected in all FQH states between ν = 0 and 1; however, between
ν = 1 and 2 only odd numerator FQH states show finite nonlocal transport, despite
the identical ground state spin polarizations in odd- and even numerator states.
The results reveal that the neutral spin-waves are both spin and sublattice polarized
making them a sensitive probe of ground state sublattice structure. Armed with
this understanding, we use nonlocal transport signal to a magnetic field tuned
isospin phase transition, showing that the emergent even denominator state at
ν = 1/2 in monolayer graphene is indeed a multicomponent state featuring equal
populations on each sublattice.
alternative_title:
- Bulletin of the American Physical Society
article_number: B54. 00007
article_processing_charge: No
author:
- first_name: Haoxin
full_name: Zhou, Haoxin
last_name: Zhou
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Takashi
full_name: Tanaguchi, Takashi
last_name: Tanaguchi
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Zhou H, Polshyn H, Tanaguchi T, Watanabe K, Young A. Sublattice resolved spin
wave transport through graphene fractional quantum Hall states as a probe of isospin
order. In: APS March Meeting 2020. Vol 65. American Physical Society; 2020.'
apa: 'Zhou, H., Polshyn, H., Tanaguchi, T., Watanabe, K., & Young, A. (2020).
Sublattice resolved spin wave transport through graphene fractional quantum Hall
states as a probe of isospin order. In APS March Meeting 2020 (Vol. 65).
Denver, CO, United States: American Physical Society.'
chicago: Zhou, Haoxin, Hryhoriy Polshyn, Takashi Tanaguchi, Kenji Watanabe, and
Andrea Young. “Sublattice Resolved Spin Wave Transport through Graphene Fractional
Quantum Hall States as a Probe of Isospin Order.” In APS March Meeting 2020,
Vol. 65. American Physical Society, 2020.
ieee: H. Zhou, H. Polshyn, T. Tanaguchi, K. Watanabe, and A. Young, “Sublattice
resolved spin wave transport through graphene fractional quantum Hall states as
a probe of isospin order,” in APS March Meeting 2020, Denver, CO, United
States, 2020, vol. 65, no. 1.
ista: 'Zhou H, Polshyn H, Tanaguchi T, Watanabe K, Young A. 2020. Sublattice resolved
spin wave transport through graphene fractional quantum Hall states as a probe
of isospin order. APS March Meeting 2020. APS: American Physical Society, Bulletin
of the American Physical Society, vol. 65, B54. 00007.'
mla: Zhou, Haoxin, et al. “Sublattice Resolved Spin Wave Transport through Graphene
Fractional Quantum Hall States as a Probe of Isospin Order.” APS March Meeting
2020, vol. 65, no. 1, B54. 00007, American Physical Society, 2020.
short: H. Zhou, H. Polshyn, T. Tanaguchi, K. Watanabe, A. Young, in:, APS March
Meeting 2020, American Physical Society, 2020.
conference:
end_date: 2020-03-06
location: Denver, CO, United States
name: 'APS: American Physical Society'
start_date: 2020-03-02
date_created: 2022-01-27T10:50:10Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2022-01-27T10:58:38Z
day: '01'
extern: '1'
intvolume: ' 65'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR20/Session/B54.7
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2020
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Sublattice resolved spin wave transport through graphene fractional quantum
Hall states as a probe of isospin order
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 65
year: '2020'
...
---
_id: '10696'
abstract:
- lang: eng
text: We experimentally investigate twisted van der Waals heterostructures of monolayer
graphene rotated with respect to a bernal stacked graphene bilayer. We report
transport measurements for devices with twist angles between 0.9 and 1.4°. The
electric field allows efficient tuning of the width, isolation and the topology
of the moiré bands in this system. By comparing magnetoresistance measurements
to numerical simulations, we develop an understanding of the band structure. Finally,
we observe correlated states at half- and quarter-fillings, which arise when narrow
moire sublattice band is isolated by energy gaps from dispersive bands. We investigate
the effects of in-plane and out-of-plane magnetic field on these states and discuss
the implication for their spin- and valley- polarization.
alternative_title:
- Bulletin of the American Physical Society
article_number: B51.00005
article_processing_charge: No
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Jihang
full_name: Zhu, Jihang
last_name: Zhu
- first_name: Manish
full_name: Kumar, Manish
last_name: Kumar
- first_name: Takashi
full_name: Taniguchi, Takashi
last_name: Taniguchi
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Allan
full_name: MacDonald, Allan
last_name: MacDonald
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Polshyn H, Zhu J, Kumar M, et al. Correlated states and tunable topological
bands in twisted monolayer-bilayer graphene heterostructures. In: APS March
Meeting 2020. Vol 65. American Physical Society; 2020.'
apa: 'Polshyn, H., Zhu, J., Kumar, M., Taniguchi, T., Watanabe, K., MacDonald, A.,
& Young, A. (2020). Correlated states and tunable topological bands in twisted
monolayer-bilayer graphene heterostructures. In APS March Meeting 2020
(Vol. 65). Denver, CO, United States: American Physical Society.'
chicago: Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Takashi Taniguchi, Kenji Watanabe,
Allan MacDonald, and Andrea Young. “Correlated States and Tunable Topological
Bands in Twisted Monolayer-Bilayer Graphene Heterostructures.” In APS March
Meeting 2020, Vol. 65. American Physical Society, 2020.
ieee: H. Polshyn et al., “Correlated states and tunable topological bands
in twisted monolayer-bilayer graphene heterostructures,” in APS March Meeting
2020, Denver, CO, United States, 2020, vol. 65, no. 1.
ista: 'Polshyn H, Zhu J, Kumar M, Taniguchi T, Watanabe K, MacDonald A, Young A.
2020. Correlated states and tunable topological bands in twisted monolayer-bilayer
graphene heterostructures. APS March Meeting 2020. APS: American Physical Society,
Bulletin of the American Physical Society, vol. 65, B51.00005.'
mla: Polshyn, Hryhoriy, et al. “Correlated States and Tunable Topological Bands
in Twisted Monolayer-Bilayer Graphene Heterostructures.” APS March Meeting
2020, vol. 65, no. 1, B51.00005, American Physical Society, 2020.
short: H. Polshyn, J. Zhu, M. Kumar, T. Taniguchi, K. Watanabe, A. MacDonald, A.
Young, in:, APS March Meeting 2020, American Physical Society, 2020.
conference:
end_date: 2020-03-06
location: Denver, CO, United States
name: 'APS: American Physical Society'
start_date: 2020-03-02
date_created: 2022-01-28T10:09:19Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2022-02-08T10:22:08Z
day: '01'
extern: '1'
intvolume: ' 65'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR20/Session/B51.5
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2020
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Correlated states and tunable topological bands in twisted monolayer-bilayer
graphene heterostructures
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 65
year: '2020'
...
---
_id: '10697'
abstract:
- lang: eng
text: We report the observation of a quantized anomalous Hall effect in a moiré
heterostructure consisting of twisted bilayer graphene aligned to an encapsulating
hBN substrate. The effect occurs at a density of 3 electrons per superlattice
unit cell, where we observe magnetic hysteresis and a Hall resistance quantized
to within 0.1% of the resistance quantum at temperatures as high as 3K. In this
first of 3 talks, I will describe the fabrication procedure for our device as
well as basic transport characterization measurements. I will introduce the phenomenology
of twisted bilayer graphene and present evidence for hBN alignment as manifested
in the hierarchy of symmetry-breaking gaps and anomalous magnetoresistance.
acknowledgement: I would like to thank the MURI program, Sloan foundation, AFOSR,
and ARO for their generous support of this work.
alternative_title:
- Bulletin of the American Physical Society
article_number: B59.00012
article_processing_charge: No
arxiv: 1
author:
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: Marec
full_name: Serlin, Marec
last_name: Serlin
- first_name: Charles
full_name: Tschirhart, Charles
last_name: Tschirhart
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Jiacheng
full_name: Zhu, Jiacheng
last_name: Zhu
- first_name: Leon
full_name: Balents, Leon
last_name: Balents
- first_name: Martin E.
full_name: Huber, Martin E.
last_name: Huber
- first_name: Takashi
full_name: Taniguchi, Takashi
last_name: Taniguchi
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Zhang Y, Serlin M, Tschirhart C, et al. Intrinsic quantized anomalous Hall
effect in a moiré heterostructure, part I: Device fabrication and transport. In:
APS March Meeting 2020. Vol 65. American Physical Society; 2020.'
apa: 'Zhang, Y., Serlin, M., Tschirhart, C., Polshyn, H., Zhu, J., Balents, L.,
… Young, A. (2020). Intrinsic quantized anomalous Hall effect in a moiré heterostructure,
part I: Device fabrication and transport. In APS March Meeting 2020 (Vol.
65). Denver, CO, United States: American Physical Society.'
chicago: 'Zhang, Yuxuan, Marec Serlin, Charles Tschirhart, Hryhoriy Polshyn, Jiacheng
Zhu, Leon Balents, Martin E. Huber, Takashi Taniguchi, Kenji Watanabe, and Andrea
Young. “Intrinsic Quantized Anomalous Hall Effect in a Moiré Heterostructure,
Part I: Device Fabrication and Transport.” In APS March Meeting 2020, Vol.
65. American Physical Society, 2020.'
ieee: 'Y. Zhang et al., “Intrinsic quantized anomalous Hall effect in a moiré
heterostructure, part I: Device fabrication and transport,” in APS March Meeting
2020, Denver, CO, United States, 2020, vol. 65, no. 1.'
ista: 'Zhang Y, Serlin M, Tschirhart C, Polshyn H, Zhu J, Balents L, Huber ME, Taniguchi
T, Watanabe K, Young A. 2020. Intrinsic quantized anomalous Hall effect in a moiré
heterostructure, part I: Device fabrication and transport. APS March Meeting 2020.
APS: American Physical Society, Bulletin of the American Physical Society, vol.
65, B59.00012.'
mla: 'Zhang, Yuxuan, et al. “Intrinsic Quantized Anomalous Hall Effect in a Moiré
Heterostructure, Part I: Device Fabrication and Transport.” APS March Meeting
2020, vol. 65, no. 1, B59.00012, American Physical Society, 2020.'
short: Y. Zhang, M. Serlin, C. Tschirhart, H. Polshyn, J. Zhu, L. Balents, M.E.
Huber, T. Taniguchi, K. Watanabe, A. Young, in:, APS March Meeting 2020, American
Physical Society, 2020.
conference:
end_date: 2020-03-06
location: Denver, CO, United States
name: 'APS: American Physical Society'
start_date: 2020-03-02
date_created: 2022-01-28T10:28:35Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-02-21T15:57:52Z
day: '01'
extern: '1'
external_id:
arxiv:
- '1907.00261'
intvolume: ' 65'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR20/Session/B59.12
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2020
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '10619'
relation: other
status: public
status: public
title: 'Intrinsic quantized anomalous Hall effect in a moiré heterostructure, part
I: Device fabrication and transport'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 65
year: '2020'
...
---
_id: '10698'
abstract:
- lang: eng
text: This is the second of three talks describing the observation and characterization
of a ferromagnetic moiré heterostructure based on twisted bilayer graphene aligned
to hexagonal boron nitride. I will compare the qualitative and quantitative features
of this observed quantum anomalous Hall state to traditional systems engineered
from thin film (Bi,Sb)2Te3 topological insulators. In particular, we find that
the measured electronic energy gap of ~30K is several times higher than the Curie
temperature, consistent with a lack of disorder associated with magnetic dopants.
In this system, the quantization arises from spontaneous ferromagnetic polarization
into a single spin and valley moiré subband, which is topological despite the
lack of spin orbit coupling. I will also discuss the observation of current induced
switching, which allows the magnetic state of the heterostructure to be controllably
reversed with currents as small as a few nanoamperes.
acknowledgement: I would like to thank the MURI Program, AFOSR, Sloan Foundation,
and the ARO for their generous support of this work.
alternative_title:
- Bulletin of the American Physical Society
article_number: B59.00011
article_processing_charge: No
arxiv: 1
author:
- first_name: Marec
full_name: Serlin, Marec
last_name: Serlin
- first_name: Charles
full_name: Tschirhart, Charles
last_name: Tschirhart
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: Jiacheng
full_name: Zhu, Jiacheng
last_name: Zhu
- first_name: Martin E.
full_name: Huber, Martin E.
last_name: Huber
- first_name: Leon
full_name: Balents, Leon
last_name: Balents
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Takashi
full_name: Tanaguchi, Takashi
last_name: Tanaguchi
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Serlin M, Tschirhart C, Polshyn H, et al. Intrinsic quantized anomalous Hall
effect in a moiré heterostructure, part II: Temperature dependence and current
switching. In: APS March Meeting 2020. Vol 65. American Physical Society;
2020.'
apa: 'Serlin, M., Tschirhart, C., Polshyn, H., Zhang, Y., Zhu, J., Huber, M. E.,
… Young, A. (2020). Intrinsic quantized anomalous Hall effect in a moiré heterostructure,
part II: Temperature dependence and current switching. In APS March Meeting
2020 (Vol. 65). Denver, CO, United States: American Physical Society.'
chicago: 'Serlin, Marec, Charles Tschirhart, Hryhoriy Polshyn, Yuxuan Zhang, Jiacheng
Zhu, Martin E. Huber, Leon Balents, Kenji Watanabe, Takashi Tanaguchi, and Andrea
Young. “Intrinsic Quantized Anomalous Hall Effect in a Moiré Heterostructure,
Part II: Temperature Dependence and Current Switching.” In APS March Meeting
2020, Vol. 65. American Physical Society, 2020.'
ieee: 'M. Serlin et al., “Intrinsic quantized anomalous Hall effect in a
moiré heterostructure, part II: Temperature dependence and current switching,”
in APS March Meeting 2020, Denver, CO, United States, 2020, vol. 65, no.
1.'
ista: 'Serlin M, Tschirhart C, Polshyn H, Zhang Y, Zhu J, Huber ME, Balents L, Watanabe
K, Tanaguchi T, Young A. 2020. Intrinsic quantized anomalous Hall effect in a
moiré heterostructure, part II: Temperature dependence and current switching.
APS March Meeting 2020. APS: American Physical Society, Bulletin of the American
Physical Society, vol. 65, B59.00011.'
mla: 'Serlin, Marec, et al. “Intrinsic Quantized Anomalous Hall Effect in a Moiré
Heterostructure, Part II: Temperature Dependence and Current Switching.” APS
March Meeting 2020, vol. 65, no. 1, B59.00011, American Physical Society,
2020.'
short: M. Serlin, C. Tschirhart, H. Polshyn, Y. Zhang, J. Zhu, M.E. Huber, L. Balents,
K. Watanabe, T. Tanaguchi, A. Young, in:, APS March Meeting 2020, American Physical
Society, 2020.
conference:
end_date: 2020-03-06
location: Denver, CO, United States
name: 'APS: American Physical Society'
start_date: 2020-03-02
date_created: 2022-01-28T10:46:57Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-02-21T15:57:52Z
day: '01'
extern: '1'
external_id:
arxiv:
- '1907.00261'
intvolume: ' 65'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR20/Session/B59.11
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2020
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '10619'
relation: other
status: public
status: public
title: 'Intrinsic quantized anomalous Hall effect in a moiré heterostructure, part
II: Temperature dependence and current switching'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 65
year: '2020'
...
---
_id: '10699'
abstract:
- lang: eng
text: This is the third of three talks describing the observation and characterization
of a ferromagnetic moiré heterostructure based on twisted bilayer graphene aligned
to hexagonal boron nitride. In this segment I will present scanning probe magnetometry
data acquired using a nanoSQUID-on-tip microscope, which provides ~150 nm spatial
resolution and a field sensitivity of ~10 nT/rtHz. We study the distribution of
magnetic domains within the device as a function of density, magnetic field training,
and DC current. Our data allow us to constrain the magnitude of the orbital magnetic
moment of the electrons in the QAH state. Comparison with simultaneously acquired
transport data allows us to precisely correlate single domain dynamics with discrete
jumps in the observed anomalous Hall signal.
acknowledgement: I would like to thank the MURI program, Sloan foundation, AFOSR,
and ARO for their generous support of this work. I would also like to thank the
NSF GRFP and the Hertz foundation for their generous support of my graduate studies.
alternative_title:
- Bulletin of the American Physical Society
article_number: B59.00013
article_processing_charge: No
arxiv: 1
author:
- first_name: Charles
full_name: Tschirhart, Charles
last_name: Tschirhart
- first_name: Marec
full_name: Serlin, Marec
last_name: Serlin
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: Jiacheng
full_name: Zhu, Jiacheng
last_name: Zhu
- first_name: Leon
full_name: Balents, Leon
last_name: Balents
- first_name: Martin E.
full_name: Huber, Martin E.
last_name: Huber
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Takashi
full_name: Tanaguchi, Takashi
last_name: Tanaguchi
- first_name: Andrea
full_name: Young, Andrea
last_name: Young
citation:
ama: 'Tschirhart C, Serlin M, Polshyn H, et al. Intrinsic quantized anomalous Hall
effect in a moiré heterostructure, part III: Scanning probe magnetometry. In:
APS March Meeting 2020. Vol 65. American Physical Society; 2020.'
apa: 'Tschirhart, C., Serlin, M., Polshyn, H., Zhang, Y., Zhu, J., Balents, L.,
… Young, A. (2020). Intrinsic quantized anomalous Hall effect in a moiré heterostructure,
part III: Scanning probe magnetometry. In APS March Meeting 2020 (Vol.
65). Denver, CO, United States: American Physical Society.'
chicago: 'Tschirhart, Charles, Marec Serlin, Hryhoriy Polshyn, Yuxuan Zhang, Jiacheng
Zhu, Leon Balents, Martin E. Huber, Kenji Watanabe, Takashi Tanaguchi, and Andrea
Young. “Intrinsic Quantized Anomalous Hall Effect in a Moiré Heterostructure,
Part III: Scanning Probe Magnetometry.” In APS March Meeting 2020, Vol.
65. American Physical Society, 2020.'
ieee: 'C. Tschirhart et al., “Intrinsic quantized anomalous Hall effect in
a moiré heterostructure, part III: Scanning probe magnetometry,” in APS March
Meeting 2020, Denver, CO, United States, 2020, vol. 65, no. 1.'
ista: 'Tschirhart C, Serlin M, Polshyn H, Zhang Y, Zhu J, Balents L, Huber ME, Watanabe
K, Tanaguchi T, Young A. 2020. Intrinsic quantized anomalous Hall effect in a
moiré heterostructure, part III: Scanning probe magnetometry. APS March Meeting
2020. APS: American Physical Society, Bulletin of the American Physical Society,
vol. 65, B59.00013.'
mla: 'Tschirhart, Charles, et al. “Intrinsic Quantized Anomalous Hall Effect in
a Moiré Heterostructure, Part III: Scanning Probe Magnetometry.” APS March
Meeting 2020, vol. 65, no. 1, B59.00013, American Physical Society, 2020.'
short: C. Tschirhart, M. Serlin, H. Polshyn, Y. Zhang, J. Zhu, L. Balents, M.E.
Huber, K. Watanabe, T. Tanaguchi, A. Young, in:, APS March Meeting 2020, American
Physical Society, 2020.
conference:
end_date: 2020-03-06
location: Denver, CO, United States
name: 'APS: American Physical Society'
start_date: 2020-03-02
date_created: 2022-01-28T10:57:49Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-02-21T15:57:52Z
day: '01'
extern: '1'
external_id:
arxiv:
- '1907.00261'
intvolume: ' 65'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR20/Session/B59.13
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2020
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '10619'
relation: other
status: public
status: public
title: 'Intrinsic quantized anomalous Hall effect in a moiré heterostructure, part
III: Scanning probe magnetometry'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 65
year: '2020'
...
---
_id: '10701'
abstract:
- lang: eng
text: Partially filled Landau levels host competing electronic orders. For example,
electron solids may prevail close to integer filling of the Landau levels before
giving way to fractional quantum Hall liquids at higher carrier density1,2. Here,
we report the observation of an electron solid with non-collinear spin texture
in monolayer graphene, consistent with solidification of skyrmions3—topological
spin textures characterized by quantized electrical charge4,5. We probe the spin
texture of the solids using a modified Corbino geometry that allows ferromagnetic
magnons to be launched and detected6,7. We find that magnon transport is highly
efficient when one Landau level is filled (ν=1), consistent with quantum Hall
ferromagnetic spin polarization. However, even minimal doping immediately quenches
the magnon signal while leaving the vanishing low-temperature charge conductivity
unchanged. Our results can be understood by the formation of a solid of charged
skyrmions near ν=1, whose non-collinear spin texture leads to rapid magnon decay.
Data near fractional fillings show evidence of several fractional skyrmion solids,
suggesting that graphene hosts a highly tunable landscape of coupled spin and
charge orders.
acknowledgement: We acknowledge discussions with B. Halperin, C. Huang, A. Macdonald
and M. Zalatel. Experimental work at UCSB was supported by the Army Research Office
under awards nos. MURI W911NF-16-1-0361 and W911NF-16-1-0482. K.W. and T.T. acknowledge
support from the Elemental Strategy Initiative conducted by MEXT (Japan) and CREST
(JPMJCR15F3), JST. A.F.Y. acknowledges the support of the David and Lucile Packard
Foundation and and Alfred. P. Sloan Foundation.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Haoxin
full_name: Zhou, Haoxin
last_name: Zhou
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Takashi
full_name: Taniguchi, Takashi
last_name: Taniguchi
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Andrea F.
full_name: Young, Andrea F.
last_name: Young
citation:
ama: Zhou H, Polshyn H, Taniguchi T, Watanabe K, Young AF. Skyrmion solids in monolayer
graphene. Nature Physics. 2020;16(2):154-158. doi:10.1038/s41567-019-0729-8
apa: Zhou, H., Polshyn, H., Taniguchi, T., Watanabe, K., & Young, A. F. (2020).
Skyrmion solids in monolayer graphene. Nature Physics. Springer Nature.
https://doi.org/10.1038/s41567-019-0729-8
chicago: Zhou, Haoxin, Hryhoriy Polshyn, Takashi Taniguchi, Kenji Watanabe, and
Andrea F. Young. “Skyrmion Solids in Monolayer Graphene.” Nature Physics.
Springer Nature, 2020. https://doi.org/10.1038/s41567-019-0729-8.
ieee: H. Zhou, H. Polshyn, T. Taniguchi, K. Watanabe, and A. F. Young, “Skyrmion
solids in monolayer graphene,” Nature Physics, vol. 16, no. 2. Springer
Nature, pp. 154–158, 2020.
ista: Zhou H, Polshyn H, Taniguchi T, Watanabe K, Young AF. 2020. Skyrmion solids
in monolayer graphene. Nature Physics. 16(2), 154–158.
mla: Zhou, Haoxin, et al. “Skyrmion Solids in Monolayer Graphene.” Nature Physics,
vol. 16, no. 2, Springer Nature, 2020, pp. 154–58, doi:10.1038/s41567-019-0729-8.
short: H. Zhou, H. Polshyn, T. Taniguchi, K. Watanabe, A.F. Young, Nature Physics
16 (2020) 154–158.
date_created: 2022-01-28T12:04:09Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2022-01-31T07:10:07Z
day: '01'
doi: 10.1038/s41567-019-0729-8
extern: '1'
external_id:
arxiv:
- '1904.11485'
intvolume: ' 16'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.11485
month: '02'
oa: 1
oa_version: Preprint
page: 154-158
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Skyrmion solids in monolayer graphene
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 16
year: '2020'
...
---
_id: '9415'
abstract:
- lang: eng
text: 'Optimizing convolutional neural networks for fast inference has recently
become an extremely active area of research. One of the go-to solutions in this
context is weight pruning, which aims to reduce computational and memory footprint
by removing large subsets of the connections in a neural network. Surprisingly,
much less attention has been given to exploiting sparsity in the activation maps,
which tend to be naturally sparse in many settings thanks to the structure of
rectified linear (ReLU) activation functions. In this paper, we present an in-depth
analysis of methods for maximizing the sparsity of the activations in a trained
neural network, and show that, when coupled with an efficient sparse-input convolution
algorithm, we can leverage this sparsity for significant performance gains. To
induce highly sparse activation maps without accuracy loss, we introduce a new
regularization technique, coupled with a new threshold-based sparsification method
based on a parameterized activation function called Forced-Activation-Threshold
Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular
image classification models, showing that most architectures can adapt to significantly
sparser activation maps without any accuracy loss. Our second contribution is
showing that these these compression gains can be translated into inference speedups:
we provide a new algorithm to enable fast convolution operations over networks
with sparse activations, and show that it can enable significant speedups for
end-to-end inference on a range of popular models on the large-scale ImageNet
image classification task on modern Intel CPUs, with little or no retraining cost. '
article_processing_charge: No
author:
- first_name: Mark
full_name: Kurtz, Mark
last_name: Kurtz
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: John
full_name: Carr, John
last_name: Carr
- first_name: Michael
full_name: Goin, Michael
last_name: Goin
- first_name: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Sage
full_name: Moore, Sage
last_name: Moore
- first_name: Bill
full_name: Nell, Bill
last_name: Nell
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation
sparsity for fast neural network inference. In: 37th International Conference
on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.'
apa: Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., …
Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural
network inference. In 37th International Conference on Machine Learning, ICML
2020 (Vol. 119, pp. 5533–5543). Online.
chicago: Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John
Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation
Sparsity for Fast Neural Network Inference.” In 37th International Conference
on Machine Learning, ICML 2020, 119:5533–43, 2020.
ieee: M. Kurtz et al., “Inducing and exploiting activation sparsity for fast
neural network inference,” in 37th International Conference on Machine Learning,
ICML 2020, Online, 2020, vol. 119, pp. 5533–5543.
ista: 'Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W,
Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation
sparsity for fast neural network inference. 37th International Conference on Machine
Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119,
5533–5543.'
mla: Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural
Network Inference.” 37th International Conference on Machine Learning, ICML
2020, vol. 119, 2020, pp. 5533–43.
short: M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson,
S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference
on Machine Learning, ICML 2020, 2020, pp. 5533–5543.
conference:
end_date: 2020-07-18
location: Online
name: 'ICML: International Conference on Machine Learning'
start_date: 2020-07-12
date_created: 2021-05-23T22:01:45Z
date_published: 2020-07-12T00:00:00Z
date_updated: 2023-02-23T13:57:24Z
day: '12'
ddc:
- '000'
department:
- _id: DaAl
file:
- access_level: open_access
checksum: 2aaaa7d7226e49161311d91627cf783b
content_type: application/pdf
creator: kschuh
date_created: 2021-05-25T09:51:36Z
date_updated: 2021-05-25T09:51:36Z
file_id: '9421'
file_name: 2020_PMLR_Kurtz.pdf
file_size: 741899
relation: main_file
success: 1
file_date_updated: 2021-05-25T09:51:36Z
has_accepted_license: '1'
intvolume: ' 119'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 5533-5543
publication: 37th International Conference on Machine Learning, ICML 2020
publication_identifier:
issn:
- 2640-3498
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inducing and exploiting activation sparsity for fast neural network inference
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '9526'
abstract:
- lang: eng
text: DNA methylation and histone H1 mediate transcriptional silencing of genes
and transposable elements, but how they interact is unclear. In plants and animals
with mosaic genomic methylation, functionally mysterious methylation is also common
within constitutively active housekeeping genes. Here, we show that H1 is enriched
in methylated sequences, including genes, of Arabidopsis thaliana, yet this enrichment
is independent of DNA methylation. Loss of H1 disperses heterochromatin, globally
alters nucleosome organization, and activates H1-bound genes, but only weakly
de-represses transposable elements. However, H1 loss strongly activates transposable
elements hypomethylated through mutation of DNA methyltransferase MET1. Hypomethylation
of genes also activates antisense transcription, which is modestly enhanced by
H1 loss. Our results demonstrate that H1 and DNA methylation jointly maintain
transcriptional homeostasis by silencing transposable elements and aberrant intragenic
transcripts. Such functionality plausibly explains why DNA methylation, a well-known
mutagen, has been maintained within coding sequences of crucial plant and animal
genes.
article_processing_charge: No
article_type: original
author:
- first_name: Jaemyung
full_name: Choi, Jaemyung
last_name: Choi
- first_name: David B.
full_name: Lyons, David B.
last_name: Lyons
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Jonathan D.
full_name: Moore, Jonathan D.
last_name: Moore
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. DNA methylation and histone
H1 jointly repress transposable elements and aberrant intragenic transcripts.
Molecular Cell. 2020;77(2):310-323.e7. doi:10.1016/j.molcel.2019.10.011
apa: Choi, J., Lyons, D. B., Kim, M. Y., Moore, J. D., & Zilberman, D. (2020).
DNA methylation and histone H1 jointly repress transposable elements and aberrant
intragenic transcripts. Molecular Cell. Elsevier. https://doi.org/10.1016/j.molcel.2019.10.011
chicago: Choi, Jaemyung, David B. Lyons, M. Yvonne Kim, Jonathan D. Moore, and Daniel
Zilberman. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements
and Aberrant Intragenic Transcripts.” Molecular Cell. Elsevier, 2020. https://doi.org/10.1016/j.molcel.2019.10.011.
ieee: J. Choi, D. B. Lyons, M. Y. Kim, J. D. Moore, and D. Zilberman, “DNA methylation
and histone H1 jointly repress transposable elements and aberrant intragenic transcripts,”
Molecular Cell, vol. 77, no. 2. Elsevier, p. 310–323.e7, 2020.
ista: Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. 2020. DNA methylation and
histone H1 jointly repress transposable elements and aberrant intragenic transcripts.
Molecular Cell. 77(2), 310–323.e7.
mla: Choi, Jaemyung, et al. “DNA Methylation and Histone H1 Jointly Repress Transposable
Elements and Aberrant Intragenic Transcripts.” Molecular Cell, vol. 77,
no. 2, Elsevier, 2020, p. 310–323.e7, doi:10.1016/j.molcel.2019.10.011.
short: J. Choi, D.B. Lyons, M.Y. Kim, J.D. Moore, D. Zilberman, Molecular Cell 77
(2020) 310–323.e7.
date_created: 2021-06-08T06:37:09Z
date_published: 2020-01-16T00:00:00Z
date_updated: 2021-12-14T07:51:15Z
day: '16'
department:
- _id: DaZi
doi: 10.1016/j.molcel.2019.10.011
extern: '1'
external_id:
pmid:
- '31732458'
intvolume: ' 77'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.molcel.2019.10.011
month: '01'
oa: 1
oa_version: Published Version
page: 310-323.e7
pmid: 1
publication: Molecular Cell
publication_identifier:
eissn:
- 1097-4164
issn:
- 1097-2765
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: DNA methylation and histone H1 jointly repress transposable elements and aberrant
intragenic transcripts
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 77
year: '2020'
...
---
_id: '9573'
abstract:
- lang: eng
text: It is a classical fact that for any ε>0, a random permutation of length n=(1+ε)k2/4
typically contains a monotone subsequence of length k. As a far-reaching generalization,
Alon conjectured that a random permutation of this same length n is typically
k-universal, meaning that it simultaneously contains every pattern of length k.
He also made the simple observation that for n=O(k2logk), a random length-n permutation
is typically k-universal. We make the first significant progress towards Alon's
conjecture by showing that n=2000k2loglogk suffices.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
full_name: He, Xiaoyu
last_name: He
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
citation:
ama: He X, Kwan MA. Universality of random permutations. Bulletin of the London
Mathematical Society. 2020;52(3):515-529. doi:10.1112/blms.12345
apa: He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin
of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345
chicago: He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.”
Bulletin of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/blms.12345.
ieee: X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of
the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.
ista: He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the
London Mathematical Society. 52(3), 515–529.
mla: He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin
of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29,
doi:10.1112/blms.12345.
short: X. He, M.A. Kwan, Bulletin of the London Mathematical Society 52 (2020) 515–529.
date_created: 2021-06-21T06:23:42Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-02-23T14:01:23Z
day: '01'
doi: 10.1112/blms.12345
extern: '1'
external_id:
arxiv:
- '1911.12878'
intvolume: ' 52'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1911.12878
month: '06'
oa: 1
oa_version: Preprint
page: 515-529
publication: Bulletin of the London Mathematical Society
publication_identifier:
eissn:
- 1469-2120
issn:
- 0024-6093
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Universality of random permutations
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 52
year: '2020'
...
---
_id: '9576'
abstract:
- lang: eng
text: In 1989, Rota made the following conjecture. Given n bases B1,…,Bn in an n-dimensional
vector space V, one can always find n disjoint bases of V, each containing exactly
one element from each Bi (we call such bases transversal bases). Rota’s basis
conjecture remains wide open despite its apparent simplicity and the efforts of
many researchers (e.g., the conjecture was recently the subject of the collaborative
“Polymath” project). In this paper we prove that one can always find (1/2−o(1))n
disjoint transversal bases, improving on the previous best bound of Ω(n/logn).
Our results also apply to the more general setting of matroids.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matija
full_name: Bucić, Matija
last_name: Bucić
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Alexey
full_name: Pokrovskiy, Alexey
last_name: Pokrovskiy
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
citation:
ama: Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. Halfway to Rota’s basis conjecture.
International Mathematics Research Notices. 2020;2020(21):8007-8026. doi:10.1093/imrn/rnaa004
apa: Bucić, M., Kwan, M. A., Pokrovskiy, A., & Sudakov, B. (2020). Halfway to
Rota’s basis conjecture. International Mathematics Research Notices. Oxford
University Press. https://doi.org/10.1093/imrn/rnaa004
chicago: Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, and Benny Sudakov.
“Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices.
Oxford University Press, 2020. https://doi.org/10.1093/imrn/rnaa004.
ieee: M. Bucić, M. A. Kwan, A. Pokrovskiy, and B. Sudakov, “Halfway to Rota’s basis
conjecture,” International Mathematics Research Notices, vol. 2020, no.
21. Oxford University Press, pp. 8007–8026, 2020.
ista: Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. 2020. Halfway to Rota’s basis conjecture.
International Mathematics Research Notices. 2020(21), 8007–8026.
mla: Bucić, Matija, et al. “Halfway to Rota’s Basis Conjecture.” International
Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press,
2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.
short: M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, International Mathematics
Research Notices 2020 (2020) 8007–8026.
date_created: 2021-06-21T08:12:30Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2023-02-23T14:01:30Z
day: '01'
doi: 10.1093/imrn/rnaa004
extern: '1'
external_id:
arxiv:
- '1810.07462'
intvolume: ' 2020'
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv-export-lb.library.cornell.edu/abs/1810.07462
month: '11'
oa: 1
oa_version: Preprint
page: 8007-8026
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Halfway to Rota’s basis conjecture
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 2020
year: '2020'
...
---
_id: '9577'
abstract:
- lang: eng
text: An n-vertex graph is called C-Ramsey if it has no clique or independent set
of size Clogn. All known constructions of Ramsey graphs involve randomness in
an essential way, and there is an ongoing line of research towards showing that
in fact all Ramsey graphs must obey certain “richness” properties characteristic
of random graphs. Motivated by an old problem of Erd̋s and McKay, recently Narayanan,
Sahasrabudhe, and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey
graph induces subgraphs of Θ(n2) different sizes. In this paper we prove this
conjecture.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
citation:
ama: Kwan MA, Sudakov B. Ramsey graphs induce subgraphs of quadratically many sizes.
International Mathematics Research Notices. 2020;2020(6):1621–1638. doi:10.1093/imrn/rny064
apa: Kwan, M. A., & Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically
many sizes. International Mathematics Research Notices. Oxford University
Press. https://doi.org/10.1093/imrn/rny064
chicago: Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs
of Quadratically Many Sizes.” International Mathematics Research Notices.
Oxford University Press, 2020. https://doi.org/10.1093/imrn/rny064.
ieee: M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically
many sizes,” International Mathematics Research Notices, vol. 2020, no.
6. Oxford University Press, pp. 1621–1638, 2020.
ista: Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically
many sizes. International Mathematics Research Notices. 2020(6), 1621–1638.
mla: Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically
Many Sizes.” International Mathematics Research Notices, vol. 2020, no.
6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.
short: M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020)
1621–1638.
date_created: 2021-06-21T08:30:12Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2023-02-23T14:01:33Z
day: '01'
doi: 10.1093/imrn/rny064
extern: '1'
external_id:
arxiv:
- '1711.02937'
intvolume: ' 2020'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/imrn/rny064
month: '03'
oa: 1
oa_version: Published Version
page: 1621–1638
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ramsey graphs induce subgraphs of quadratically many sizes
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 2020
year: '2020'
...
---
_id: '9578'
abstract:
- lang: eng
text: How long a monotone path can one always find in any edge-ordering of the complete
graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971,
and has since attracted the attention of many researchers, inspiring a variety
of related problems. The prevailing conjecture is that one can always find a monotone
path of linear length, but until now the best known lower bound was n2/3-o(1).
In this paper we almost close this gap, proving that any edge-ordering of the
complete graph contains a monotone path of length n1-o(1).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matija
full_name: Bucić, Matija
last_name: Bucić
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Alexey
full_name: Pokrovskiy, Alexey
last_name: Pokrovskiy
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
- first_name: Tuan
full_name: Tran, Tuan
last_name: Tran
- first_name: Adam Zsolt
full_name: Wagner, Adam Zsolt
last_name: Wagner
citation:
ama: Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear
monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 2020;238(2):663-685.
doi:10.1007/s11856-020-2035-7
apa: Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., & Wagner,
A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal
of Mathematics. Springer. https://doi.org/10.1007/s11856-020-2035-7
chicago: Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan
Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.”
Israel Journal of Mathematics. Springer, 2020. https://doi.org/10.1007/s11856-020-2035-7.
ieee: M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner,
“Nearly-linear monotone paths in edge-ordered graphs,” Israel Journal of Mathematics,
vol. 238, no. 2. Springer, pp. 663–685, 2020.
ista: Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear
monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2),
663–685.
mla: Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.”
Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85,
doi:10.1007/s11856-020-2035-7.
short: M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel
Journal of Mathematics 238 (2020) 663–685.
date_created: 2021-06-21T13:24:35Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2023-02-23T14:01:35Z
day: '01'
doi: 10.1007/s11856-020-2035-7
extern: '1'
external_id:
arxiv:
- '1809.01468'
intvolume: ' 238'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.01468
month: '07'
oa: 1
oa_version: Preprint
page: 663-685
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nearly-linear monotone paths in edge-ordered graphs
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 238
year: '2020'
...
---
_id: '9581'
abstract:
- lang: eng
text: "We show that for any \U0001D45B divisible by 3, almost all order- \U0001D45B
\ Steiner triple systems have a perfect matching (also known as a parallel class
or resolution class). In fact, we prove a general upper bound on the number of
perfect matchings in a Steiner triple system and show that almost all Steiner
triple systems essentially attain this maximum. We accomplish this via a general
theorem comparing a uniformly random Steiner triple system to the outcome of the
triangle removal process, which we hope will be useful for other problems. Our
methods can also be adapted to other types of designs; for example, we sketch
a proof of the theorem that almost all Latin squares have transversals."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
citation:
ama: Kwan MA. Almost all Steiner triple systems have perfect matchings. Proceedings
of the London Mathematical Society. 2020;121(6):1468-1495. doi:10.1112/plms.12373
apa: Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings.
Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12373
chicago: Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.”
Proceedings of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/plms.12373.
ieee: M. A. Kwan, “Almost all Steiner triple systems have perfect matchings,” Proceedings
of the London Mathematical Society, vol. 121, no. 6. Wiley, pp. 1468–1495,
2020.
ista: Kwan MA. 2020. Almost all Steiner triple systems have perfect matchings. Proceedings
of the London Mathematical Society. 121(6), 1468–1495.
mla: Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.”
Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley,
2020, pp. 1468–95, doi:10.1112/plms.12373.
short: M.A. Kwan, Proceedings of the London Mathematical Society 121 (2020) 1468–1495.
date_created: 2021-06-22T06:35:16Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2023-02-23T14:01:43Z
day: '01'
doi: 10.1112/plms.12373
extern: '1'
external_id:
arxiv:
- '1611.02246'
intvolume: ' 121'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.02246
month: '12'
oa: 1
oa_version: Preprint
page: 1468-1495
publication: Proceedings of the London Mathematical Society
publication_identifier:
eissn:
- 1460-244X
issn:
- 0024-6115
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Almost all Steiner triple systems have perfect matchings
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 121
year: '2020'
...
---
_id: '9582'
abstract:
- lang: eng
text: The problem of finding dense induced bipartite subgraphs in H-free graphs
has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer.
In this paper, we obtain several results in this direction. First we prove that
any H-free graph with minimum degree at least d contains an induced bipartite
subgraph of minimum degree at least cH log d/log log d, thus nearly confirming
one and proving another conjecture of Esperet, Kang and Thomassé. Complementing
this result, we further obtain optimal bounds for this problem in the case of
dense triangle-free graphs, and we also answer a question of Erdœs, Janson, Łuczak
and Spencer.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Shoham
full_name: Letzter, Shoham
last_name: Letzter
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
- first_name: Tuan
full_name: Tran, Tuan
last_name: Tran
citation:
ama: Kwan MA, Letzter S, Sudakov B, Tran T. Dense induced bipartite subgraphs in
triangle-free graphs. Combinatorica. 2020;40(2):283-305. doi:10.1007/s00493-019-4086-0
apa: Kwan, M. A., Letzter, S., Sudakov, B., & Tran, T. (2020). Dense induced
bipartite subgraphs in triangle-free graphs. Combinatorica. Springer. https://doi.org/10.1007/s00493-019-4086-0
chicago: Kwan, Matthew Alan, Shoham Letzter, Benny Sudakov, and Tuan Tran. “Dense
Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica. Springer,
2020. https://doi.org/10.1007/s00493-019-4086-0.
ieee: M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite
subgraphs in triangle-free graphs,” Combinatorica, vol. 40, no. 2. Springer,
pp. 283–305, 2020.
ista: Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs
in triangle-free graphs. Combinatorica. 40(2), 283–305.
mla: Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free
Graphs.” Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.
short: M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305.
date_created: 2021-06-22T06:42:26Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-02-23T14:01:45Z
day: '01'
doi: 10.1007/s00493-019-4086-0
extern: '1'
external_id:
arxiv:
- '1810.12144'
intvolume: ' 40'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.12144
month: '04'
oa: 1
oa_version: Preprint
page: 283-305
publication: Combinatorica
publication_identifier:
eissn:
- 1439-6912
issn:
- 0209-9683
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dense induced bipartite subgraphs in triangle-free graphs
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 40
year: '2020'
...
---
_id: '9583'
abstract:
- lang: eng
text: We show that for any n divisible by 3, almost all order-n Steiner triple systems
admit a decomposition of almost all their triples into disjoint perfect matchings
(that is, almost all Steiner triple systems are almost resolvable).
article_number: e39
article_processing_charge: No
article_type: original
author:
- first_name: Asaf
full_name: Ferber, Asaf
last_name: Ferber
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
citation:
ama: Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable.
Forum of Mathematics. 2020;8. doi:10.1017/fms.2020.29
apa: Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are
almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29
chicago: Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems
Are Almost Resolvable.” Forum of Mathematics. Cambridge University Press,
2020. https://doi.org/10.1017/fms.2020.29.
ieee: A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,”
Forum of Mathematics, vol. 8. Cambridge University Press, 2020.
ista: Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable.
Forum of Mathematics. 8, e39.
mla: Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are
Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University
Press, 2020, doi:10.1017/fms.2020.29.
short: A. Ferber, M.A. Kwan, Forum of Mathematics 8 (2020).
date_created: 2021-06-22T09:12:23Z
date_published: 2020-11-03T00:00:00Z
date_updated: 2023-02-23T14:01:48Z
day: '03'
ddc:
- '510'
doi: 10.1017/fms.2020.29
extern: '1'
external_id:
pmid:
- '1907.06744'
file:
- access_level: open_access
checksum: 5553c596bb4db0f38226a56bee9c87a1
content_type: application/pdf
creator: asandaue
date_created: 2021-06-22T09:23:59Z
date_updated: 2021-06-22T09:23:59Z
file_id: '9584'
file_name: 2020_CambridgeUniversityPress_Ferber.pdf
file_size: 601516
relation: main_file
success: 1
file_date_updated: 2021-06-22T09:23:59Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Forum of Mathematics
publication_identifier:
eissn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Almost all Steiner triple systems are almost resolvable
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 8
year: '2020'
...
---
_id: '9630'
abstract:
- lang: eng
text: Various kinds of data are routinely represented as discrete probability distributions.
Examples include text documents summarized by histograms of word occurrences and
images represented as histograms of oriented gradients. Viewing a discrete probability
distribution as a point in the standard simplex of the appropriate dimension,
we can understand collections of such objects in geometric and topological terms. Importantly,
instead of using the standard Euclidean distance, we look into dissimilarity measures
with information-theoretic justification, and we develop the theory needed for
applying topological data analysis in this setting. In doing so, we emphasize
constructions that enable the usage of existing computational topology software
in this context.
acknowledgement: This research is partially supported by the Office of Naval Research,
through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR
109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of
the Austrian Science Fund (FWF).
article_processing_charge: Yes
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ziga
full_name: Virk, Ziga
id: 2E36B656-F248-11E8-B48F-1D18A9856A87
last_name: Virk
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information
space. Journal of Computational Geometry. 2020;11(2):162-182. doi:10.20382/jocg.v11i2a7
apa: Edelsbrunner, H., Virk, Z., & Wagner, H. (2020). Topological data analysis
in information space. Journal of Computational Geometry. Carleton University.
https://doi.org/10.20382/jocg.v11i2a7
chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data
Analysis in Information Space.” Journal of Computational Geometry. Carleton
University, 2020. https://doi.org/10.20382/jocg.v11i2a7.
ieee: H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information
space,” Journal of Computational Geometry, vol. 11, no. 2. Carleton University,
pp. 162–182, 2020.
ista: Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information
space. Journal of Computational Geometry. 11(2), 162–182.
mla: Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.”
Journal of Computational Geometry, vol. 11, no. 2, Carleton University,
2020, pp. 162–82, doi:10.20382/jocg.v11i2a7.
short: H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11
(2020) 162–182.
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2021-08-11T12:26:34Z
day: '14'
ddc:
- '510'
- '000'
department:
- _id: HeEd
doi: 10.20382/jocg.v11i2a7
file:
- access_level: open_access
checksum: f02d0b2b3838e7891a6c417fc34ffdcd
content_type: application/pdf
creator: asandaue
date_created: 2021-08-11T11:55:11Z
date_updated: 2021-08-11T11:55:11Z
file_id: '9882'
file_name: 2020_JournalOfComputationalGeometry_Edelsbrunner.pdf
file_size: 1449234
relation: main_file
success: 1
file_date_updated: 2021-08-11T11:55:11Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '12'
oa: 1
oa_version: Published Version
page: 162-182
project:
- _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316
grant_number: I4887
name: Discretization in Geometry and Dynamics
publication: Journal of Computational Geometry
publication_identifier:
eissn:
- 1920180X
publication_status: published
publisher: Carleton University
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topological data analysis in information space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 11
year: '2020'
...
---
_id: '9631'
abstract:
- lang: eng
text: The ability to leverage large-scale hardware parallelism has been one of the
key enablers of the accelerated recent progress in machine learning. Consequently,
there has been considerable effort invested into developing efficient parallel
variants of classic machine learning algorithms. However, despite the wealth of
knowledge on parallelization, some classic machine learning algorithms often prove
hard to parallelize efficiently while maintaining convergence. In this paper,
we focus on efficient parallel algorithms for the key machine learning task of
inference on graphical models, in particular on the fundamental belief propagation
algorithm. We address the challenge of efficiently parallelizing this classic
paradigm by showing how to leverage scalable relaxed schedulers in this context.
We present an extensive empirical study, showing that our approach outperforms
previous parallel belief propagation implementations both in terms of scalability
and in terms of wall-clock convergence time, on a range of practical applications.
acknowledgement: "We thank Marco Mondelli for discussions related to LDPC decoding,
and Giorgi Nadiradze for discussions on analysis of relaxed schedulers. This project
has received funding from the European Research Council (ERC) under the European\r\nUnion’s
Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML)."
article_processing_charge: No
arxiv: 1
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
citation:
ama: 'Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed
scheduling. In: Advances in Neural Information Processing Systems. Vol
33. Curran Associates; 2020:22361-22372.'
apa: 'Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation
via relaxed scheduling. In Advances in Neural Information Processing Systems
(Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.'
chicago: Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief
Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing
Systems, 33:22361–72. Curran Associates, 2020.
ieee: V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation
via relaxed scheduling,” in Advances in Neural Information Processing Systems,
Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.
ista: 'Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via
relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS:
Conference on Neural Information Processing Systems vol. 33, 22361–22372.'
mla: Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.”
Advances in Neural Information Processing Systems, vol. 33, Curran Associates,
2020, pp. 22361–72.
short: V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information
Processing Systems, Curran Associates, 2020, pp. 22361–22372.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2023-02-23T14:03:03Z
day: '06'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2002.11505'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
page: 22361-22372
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
issn:
- '10495258'
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scalable belief propagation via relaxed scheduling
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 33
year: '2020'
...
---
_id: '9632'
abstract:
- lang: eng
text: "Second-order information, in the form of Hessian- or Inverse-Hessian-vector
products, is a fundamental tool for solving optimization problems. Recently, there
has been significant interest in utilizing this information in the context of
deep\r\nneural networks; however, relatively little is known about the quality
of existing approximations in this context. Our work examines this question, identifies
issues with existing approaches, and proposes a method called WoodFisher to compute
a faithful and efficient estimate of the inverse Hessian. Our main application
is to neural network compression, where we build on the classic Optimal Brain
Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms
popular state-of-the-art methods for oneshot pruning. Further, even when iterative,
gradual pruning is allowed, our method results in a gain in test accuracy over
the state-of-the-art approaches, for standard image classification datasets such
as ImageNet ILSVRC. We examine how our method can be extended to take into account
first-order information, as well as\r\nillustrate its ability to automatically
set layer-wise pruning thresholds and perform compression in the limited-data
regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher."
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko,
Alexandra Peste, and other members of the group for fruitful discussions.
article_processing_charge: No
arxiv: 1
author:
- first_name: Sidak Pal
full_name: Singh, Sidak Pal
id: DD138E24-D89D-11E9-9DC0-DEF6E5697425
last_name: Singh
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for
neural network compression. In: Advances in Neural Information Processing Systems.
Vol 33. Curran Associates; 2020:18098-18109.'
apa: 'Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order
approximation for neural network compression. In Advances in Neural Information
Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.'
chicago: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order
Approximation for Neural Network Compression.” In Advances in Neural Information
Processing Systems, 33:18098–109. Curran Associates, 2020.'
ieee: 'S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation
for neural network compression,” in Advances in Neural Information Processing
Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.'
ista: 'Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation
for neural network compression. Advances in Neural Information Processing Systems.
NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.'
mla: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order
Approximation for Neural Network Compression.” Advances in Neural Information
Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.'
short: S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing
Systems, Curran Associates, 2020, pp. 18098–18109.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2023-02-23T14:03:06Z
day: '06'
department:
- _id: DaAl
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '2004.14340'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
page: 18098-18109
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713829546'
issn:
- '10495258'
publication_status: published
publisher: Curran Associates
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'WoodFisher: Efficient second-order approximation for neural network compression'
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 33
year: '2020'
...
---
_id: '9633'
abstract:
- lang: eng
text: The search for biologically faithful synaptic plasticity rules has resulted
in a large body of models. They are usually inspired by – and fitted to – experimental
data, but they rarely produce neural dynamics that serve complex functions. These
failures suggest that current plasticity models are still under-constrained by
existing data. Here, we present an alternative approach that uses meta-learning
to discover plausible synaptic plasticity rules. Instead of experimental data,
the rules are constrained by the functions they implement and the structure they
are meant to produce. Briefly, we parameterize synaptic plasticity rules by a
Volterra expansion and then use supervised learning methods (gradient descent
or evolutionary strategies) to minimize a problem-dependent loss function that
quantifies how effectively a candidate plasticity rule transforms an initially
random network into one with the desired function. We first validate our approach
by re-discovering previously described plasticity rules, starting at the single-neuron
level and “Oja’s rule”, a simple Hebbian plasticity rule that captures the direction
of most variability of inputs to a neuron (i.e., the first principal component).
We expand the problem to the network level and ask the framework to find Oja’s
rule together with an anti-Hebbian rule such that an initially random two-layer
firing-rate network will recover several principal components of the input space
after learning. Next, we move to networks of integrate-and-fire neurons with plastic
inhibitory afferents. We train for rules that achieve a target firing rate by
countering tuned excitation. Our algorithm discovers a specific subset of the
manifold of rules that can solve this task. Our work is a proof of principle of
an automated and unbiased approach to unveil synaptic plasticity rules that obey
biological constraints and can solve complex functions.
acknowledgement: We would like to thank Chaitanya Chintaluri, Georgia Christodoulou,
Bill Podlaski and Merima Šabanovic for useful discussions and comments. This work
was supported by a Wellcome Trust ´ Senior Research Fellowship (214316/Z/18/Z),
a BBSRC grant (BB/N019512/1), an ERC consolidator Grant (SYNAPSEEK), a Leverhulme
Trust Project Grant (RPG-2016-446), and funding from École Polytechnique, Paris.
article_processing_charge: No
author:
- first_name: Basile J
full_name: Confavreux, Basile J
id: C7610134-B532-11EA-BD9F-F5753DDC885E
last_name: Confavreux
- first_name: Friedemann
full_name: Zenke, Friedemann
last_name: Zenke
- first_name: Everton J.
full_name: Agnes, Everton J.
last_name: Agnes
- first_name: Timothy
full_name: Lillicrap, Timothy
last_name: Lillicrap
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: 'Confavreux BJ, Zenke F, Agnes EJ, Lillicrap T, Vogels TP. A meta-learning
approach to (re)discover plasticity rules that carve a desired function into a
neural network. In: Advances in Neural Information Processing Systems.
Vol 33. ; 2020:16398-16408.'
apa: Confavreux, B. J., Zenke, F., Agnes, E. J., Lillicrap, T., & Vogels, T.
P. (2020). A meta-learning approach to (re)discover plasticity rules that carve
a desired function into a neural network. In Advances in Neural Information
Processing Systems (Vol. 33, pp. 16398–16408). Vancouver, Canada.
chicago: Confavreux, Basile J, Friedemann Zenke, Everton J. Agnes, Timothy Lillicrap,
and Tim P Vogels. “A Meta-Learning Approach to (Re)Discover Plasticity Rules That
Carve a Desired Function into a Neural Network.” In Advances in Neural Information
Processing Systems, 33:16398–408, 2020.
ieee: B. J. Confavreux, F. Zenke, E. J. Agnes, T. Lillicrap, and T. P. Vogels, “A
meta-learning approach to (re)discover plasticity rules that carve a desired function
into a neural network,” in Advances in Neural Information Processing Systems,
Vancouver, Canada, 2020, vol. 33, pp. 16398–16408.
ista: 'Confavreux BJ, Zenke F, Agnes EJ, Lillicrap T, Vogels TP. 2020. A meta-learning
approach to (re)discover plasticity rules that carve a desired function into a
neural network. Advances in Neural Information Processing Systems. NeurIPS: Conference
on Neural Information Processing Systems vol. 33, 16398–16408.'
mla: Confavreux, Basile J., et al. “A Meta-Learning Approach to (Re)Discover Plasticity
Rules That Carve a Desired Function into a Neural Network.” Advances in Neural
Information Processing Systems, vol. 33, 2020, pp. 16398–408.
short: B.J. Confavreux, F. Zenke, E.J. Agnes, T. Lillicrap, T.P. Vogels, in:, Advances
in Neural Information Processing Systems, 2020, pp. 16398–16408.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-07-04T22:01:27Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2023-10-18T09:20:55Z
day: '06'
department:
- _id: TiVo
ec_funded: 1
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2020/hash/bdbd5ebfde4934142c8a88e7a3796cd5-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
page: 16398-16408
project:
- _id: c084a126-5a5b-11eb-8a69-d75314a70a87
grant_number: 214316/Z/18/Z
name: What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent
neuronal networks.
- _id: 0aacfa84-070f-11eb-9043-d7eb2c709234
call_identifier: H2020
grant_number: '819603'
name: Learning the shape of synaptic plasticity rules for neuronal architectures
and function through machine learning.
publication: Advances in Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
quality_controlled: '1'
related_material:
link:
- relation: is_continued_by
url: https://doi.org/10.1101/2020.10.24.353409
record:
- id: '14422'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A meta-learning approach to (re)discover plasticity rules that carve a desired
function into a neural network
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 33
year: '2020'
...