---
_id: '9196'
abstract:
- lang: eng
text: In order to provide a local description of a regular function in a small neighbourhood
of a point x, it is sufficient by Taylor’s theorem to know the value of the function
as well as all of its derivatives up to the required order at the point x itself.
In other words, one could say that a regular function is locally modelled by the
set of polynomials. The theory of regularity structures due to Hairer generalizes
this observation and provides an abstract setup, which in the application to singular
SPDE extends the set of polynomials by functionals constructed from, e.g., white
noise. In this context, the notion of Taylor polynomials is lifted to the notion
of so-called modelled distributions. The celebrated reconstruction theorem, which
in turn was inspired by Gubinelli’s \textit {sewing lemma}, is of paramount importance
for the theory. It enables one to reconstruct a modelled distribution as a true
distribution on Rd which is locally approximated by this extended set of models
or “monomials”. In the original work of Hairer, the error is measured by means
of Hölder norms. This was then generalized to the whole scale of Besov spaces
by Hairer and Labbé. It is the aim of this work to adapt the analytic part of
the theory of regularity structures to the scale of Triebel–Lizorkin spaces.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Tommaso
full_name: Rosati, Tommaso
last_name: Rosati
citation:
ama: Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. Studia
Mathematica. 2020;252(3):251-297. doi:10.4064/sm180411-11-2
apa: Hensel, S., & Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin
type. Studia Mathematica. Instytut Matematyczny. https://doi.org/10.4064/sm180411-11-2
chicago: Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin
Type.” Studia Mathematica. Instytut Matematyczny, 2020. https://doi.org/10.4064/sm180411-11-2.
ieee: S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,”
Studia Mathematica, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297,
2020.
ista: Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type.
Studia Mathematica. 252(3), 251–297.
mla: Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin
Type.” Studia Mathematica, vol. 252, no. 3, Instytut Matematyczny, 2020,
pp. 251–97, doi:10.4064/sm180411-11-2.
short: S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297.
date_created: 2021-02-25T08:55:03Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2025-06-24T12:07:06Z
day: '01'
department:
- _id: JuFi
- _id: GradSch
doi: 10.4064/sm180411-11-2
external_id:
arxiv:
- '1709.05202'
isi:
- '000558100500002'
intvolume: ' 252'
isi: 1
issue: '3'
keyword:
- General Mathematics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1709.05202
month: '03'
oa: 1
oa_version: Preprint
page: 251-297
publication: Studia Mathematica
publication_identifier:
eissn:
- 1730-6337
issn:
- 0039-3223
publication_status: published
publisher: Instytut Matematyczny
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modelled distributions of Triebel–Lizorkin type
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 252
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '9197'
abstract:
- lang: eng
text: In this paper we introduce and study all-pay bidding games, a class of two
player, zero-sum games on graphs. The game proceeds as follows. We place a token
on some vertex in the graph and assign budgets to the two players. Each turn,
each player submits a sealed legal bid (non-negative and below their remaining
budget), which is deducted from their budget and the highest bidder moves the
token onto an adjacent vertex. The game ends once a sink is reached, and Player
1 pays Player 2 the outcome that is associated with the sink. The players attempt
to maximize their expected outcome. Our games model settings where effort (of
no inherent value) needs to be invested in an ongoing and stateful manner. On
the negative side, we show that even in simple games on DAGs, optimal strategies
may require a distribution over bids with infinite support. A central quantity
in bidding games is the ratio of the players budgets. On the positive side, we
show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation
for the optimal strategy for that ratio. We also implement it, show that it performs
well, and suggests interesting properties of these games. Then, given an outcome
c, we show an algorithm for finding the necessary and sufficient initial ratio
for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally,
while the general case has not previously been studied, solving the specific game
in which Player 1 wins iff he wins the first two auctions, has been long stated
as an open question, which we solve.
acknowledgement: This research was supported by the Austrian Science Fund (FWF) under
grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner
fellowship).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings
of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805.
doi:10.1609/aaai.v34i02.5546
apa: 'Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games
on graphs. Proceedings of the AAAI Conference on Artificial Intelligence.
New York, NY, United States: Association for the Advancement of Artificial Intelligence.
https://doi.org/10.1609/aaai.v34i02.5546'
chicago: Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games
on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence.
Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.
ieee: G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,”
Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34,
no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805,
2020.
ista: Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs.
Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.
mla: Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the
AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for
the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.
short: G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference
on Artificial Intelligence 34 (2020) 1798–1805.
conference:
end_date: 2020-02-12
location: New York, NY, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2020-02-07
date_created: 2021-02-25T09:05:18Z
date_published: 2020-04-03T00:00:00Z
date_updated: 2025-07-03T11:44:58Z
day: '03'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1609/aaai.v34i02.5546
external_id:
arxiv:
- '1911.08360'
intvolume: ' 34'
issue: '02'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1911.08360
month: '04'
oa: 1
oa_version: Preprint
page: 1798-1805
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- '9781577358350'
issn:
- 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: All-pay bidding games on graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2020'
...
---
_id: '9202'
abstract:
- lang: eng
text: We propose a novel hybridization method for stability analysis that over-approximates
nonlinear dynamical systems by switched systems with linear inclusion dynamics.
We observe that existing hybridization techniques for safety analysis that over-approximate
nonlinear dynamical systems by switched affine inclusion dynamics and provide
fixed approximation error, do not suffice for stability analysis. Hence, we propose
a hybridization method that provides a state-dependent error which converges to
zero as the state tends to the equilibrium point. The crux of our hybridization
computation is an elegant recursive algorithm that uses partial derivatives of
a given function to obtain upper and lower bound matrices for the over-approximating
linear inclusion. We illustrate our method on some examples to demonstrate the
application of the theory for stability analysis. In particular, our method is
able to establish stability of a nonlinear system which does not admit a polynomial
Lyapunov function.
acknowledgement: Miriam Garc´ıa Soto was partially supported by the Austrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially
supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award
No. N000141712577.
article_processing_charge: No
author:
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000-0003-2936-5719
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
citation:
ama: 'Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear
switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256.
doi:10.1109/RTSS49844.2020.00031'
apa: 'Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification
of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium
(pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031'
chicago: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability
Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems
Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.
ieee: M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification
of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium,
Houston, TX, USA , 2020, pp. 244–256.
ista: 'Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification
of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time
Systems Symposium, 244–256.'
mla: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification
of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium,
IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.
short: M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium,
IEEE, 2020, pp. 244–256.
conference:
end_date: 2020-12-04
location: 'Houston, TX, USA '
name: 'RTTS: Real-Time Systems Symposium'
start_date: 2020-12-01
date_created: 2021-02-26T16:38:24Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2025-04-15T06:25:57Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/RTSS49844.2020.00031
external_id:
isi:
- '000680435100021'
file:
- access_level: open_access
checksum: 8f97f229316c3b3a6f0cf99297aa0941
content_type: application/pdf
creator: mgarcias
date_created: 2021-02-26T16:38:14Z
date_updated: 2021-02-26T16:38:14Z
file_id: '9203'
file_name: main.pdf
file_size: 1125794
relation: main_file
file_date_updated: 2021-02-26T16:38:14Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 244-256
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: 2020 IEEE Real-Time Systems Symposium
publication_identifier:
eisbn:
- '9781728183244'
eissn:
- 2576-3172
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hybridization for stability verification of nonlinear switched systems
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '9221'
abstract:
- lang: eng
text: "Recent works have shown that gradient descent can find a global minimum for
over-parameterized neural networks where the widths of all the hidden layers scale
polynomially with N (N being the number of training samples). In this paper, we
prove that, for deep networks, a single layer of width N following the input layer
suffices to ensure a similar guarantee. In particular, all the remaining layers
are allowed to have constant widths, and form a pyramidal topology. We show an
application of our result to the widely used LeCun’s initialization and obtain
an over-parameterization requirement for the single wide layer of order N2.\r\n"
acknowledgement: The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and
Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc
Dinh Tran for proofreading portions of a prior version of this paper, and James
Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially
supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the
German Research Foundation (DFG) award KL 2698/2-1.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Quynh
full_name: Nguyen, Quynh
last_name: Nguyen
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer
followed by pyramidal topology. In: 34th Conference on Neural Information Processing
Systems. Vol 33. Neural Information Processing Systems Foundation; 2020:11961–11972.'
apa: 'Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks
with one wide layer followed by pyramidal topology. In 34th Conference on Neural
Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada:
Neural Information Processing Systems Foundation.'
chicago: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks
with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on
Neural Information Processing Systems, 33:11961–11972. Neural Information
Processing Systems Foundation, 2020.
ieee: Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide
layer followed by pyramidal topology,” in 34th Conference on Neural Information
Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.
ista: 'Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one
wide layer followed by pyramidal topology. 34th Conference on Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in
Neural Information Processing Systems, vol. 33, 11961–11972.'
mla: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with
One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information
Processing Systems, vol. 33, Neural Information Processing Systems Foundation,
2020, pp. 11961–11972.
short: Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing
Systems, Neural Information Processing Systems Foundation, 2020, pp. 11961–11972.
conference:
end_date: 2020-12-12
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2020-12-06
date_created: 2021-03-03T12:06:02Z
date_published: 2020-07-07T00:00:00Z
date_updated: 2025-05-14T11:27:13Z
day: '07'
department:
- _id: MaMo
external_id:
arxiv:
- '2002.07867'
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.07867
month: '07'
oa: 1
oa_version: Preprint
page: 11961–11972
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 34th Conference on Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Global convergence of deep networks with one wide layer followed by pyramidal
topology
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2020'
...
---
_id: '9222'
article_processing_charge: No
author:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: 'Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with
electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222'
apa: 'Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut
wires with electrically tunable spin–orbit coupling. Institute of Science and
Technology Austria. https://doi.org/10.15479/AT:ISTA:9222'
chicago: 'Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si
Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science
and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222.'
ieee: 'G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires
with electrically tunable spin–orbit coupling.” Institute of Science and Technology
Austria, 2020.'
ista: 'Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires
with electrically tunable spin–orbit coupling, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:9222.'
mla: 'Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut
Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science
and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222.'
short: G. Katsaros, (2020).
contributor:
- contributor_type: research_group
first_name: Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
corr_author: '1'
date_created: 2021-03-05T18:00:47Z
date_published: 2020-03-16T00:00:00Z
date_updated: 2025-06-12T07:16:21Z
day: '16'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:9222
file:
- access_level: open_access
checksum: 41b66e195ed3dbd73077feee77b05652
content_type: application/x-zip-compressed
creator: gkatsaro
date_created: 2021-03-05T17:50:45Z
date_updated: 2021-03-05T17:50:45Z
file_id: '9223'
file_name: DOI_SiteControlledHWs.zip
file_size: 13317557
relation: main_file
- access_level: open_access
checksum: a1dc5f710ba4b3bb7f248195ba754ab2
content_type: text/plain
creator: dernst
date_created: 2021-03-10T07:31:50Z
date_updated: 2021-03-10T07:31:50Z
file_id: '9233'
file_name: Readme.txt
file_size: 3515
relation: main_file
success: 1
file_date_updated: 2021-03-10T07:31:50Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '03'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '7541'
relation: used_in_publication
status: public
status: public
title: 'Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically
tunable spin–orbit coupling'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '9249'
abstract:
- lang: eng
text: Rhombic dodecahedron is a space filling polyhedron which represents the close
packing of spheres in 3D space and the Voronoi structures of the face centered
cubic (FCC) lattice. In this paper, we describe a new coordinate system where
every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid.
In order to illustrate the interest of the new coordinate system, we propose the
characterization of 3D digital plane with its topological features, such as the
interrelation between the thickness of the digital plane and the separability
constraint we aim to obtain. We also present the characterization of 3D digital
lines and study it as the intersection of multiple digital planes. Characterization
of 3D digital sphere with relevant topological features is proposed as well along
with the 48-symmetry appearing in the new coordinate system.
acknowledgement: "This work has been partially supported by the European Research
Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation
programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109,
‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no.
I 02979-N35. "
article_processing_charge: No
article_type: original
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Gaëlle
full_name: Largeteau-Skapin, Gaëlle
last_name: Largeteau-Skapin
- first_name: Rita
full_name: Zrour, Rita
last_name: Zrour
- first_name: Eric
full_name: Andres, Eric
last_name: Andres
citation:
ama: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic
dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158.
doi:10.1515/mathm-2020-0106
apa: Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital
objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and
Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106
chicago: Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital
Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and
Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106.
ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects
in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications,
vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.
ista: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in
rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications.
4(1), 143–158.
mla: Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical
Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp.
143–58, doi:10.1515/mathm-2020-0106.
short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology
- Theory and Applications 4 (2020) 143–158.
corr_author: '1'
date_created: 2021-03-16T08:55:19Z
date_published: 2020-11-17T00:00:00Z
date_updated: 2025-04-14T07:48:35Z
day: '17'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1515/mathm-2020-0106
ec_funded: 1
file:
- access_level: open_access
checksum: 4a1043fa0548a725d464017fe2483ce0
content_type: application/pdf
creator: dernst
date_created: 2021-03-22T08:56:37Z
date_updated: 2021-03-22T08:56:37Z
file_id: '9272'
file_name: 2020_MathMorpholTheoryAppl_Biswas.pdf
file_size: 3668725
relation: main_file
success: 1
file_date_updated: 2021-03-22T08:56:37Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 143-158
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Mathematical Morphology - Theory and Applications
publication_identifier:
issn:
- 2353-3390
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
status: public
title: Digital objects in rhombic dodecahedron grid
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2020'
...
---
_id: '9299'
abstract:
- lang: eng
text: We call a multigraph non-homotopic if it can be drawn in the plane in such
a way that no two edges connecting the same pair of vertices can be continuously
transformed into each other without passing through a vertex, and no loop can
be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic
multigraph on n>1 vertices can have arbitrarily many edges. We prove that the
number of crossings between the edges of a non-homotopic multigraph with n vertices
and m>4n edges is larger than cm2n for some constant c>0 , and that this
bound is tight up to a polylogarithmic factor. We also show that the lower bound
is not asymptotically sharp as n is fixed and m⟶∞ .
acknowledgement: Supported by the National Research, Development and Innovation Office,
NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional
Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant
Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant
No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full
version can be found at https://arxiv.org/abs/2006.14908.
article_processing_charge: No
arxiv: 1
author:
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Gábor
full_name: Tardos, Gábor
last_name: Tardos
- first_name: Géza
full_name: Tóth, Géza
last_name: Tóth
citation:
ama: 'Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th
International Symposium on Graph Drawing and Network Visualization. Vol 12590.
LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28'
apa: 'Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic
edges. In 28th International Symposium on Graph Drawing and Network Visualization
(Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28'
chicago: Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic
Edges.” In 28th International Symposium on Graph Drawing and Network Visualization,
12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28.
ieee: J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,”
in 28th International Symposium on Graph Drawing and Network Visualization,
Virtual, Online, 2020, vol. 12590, pp. 359–371.
ista: 'Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th
International Symposium on Graph Drawing and Network Visualization. GD: Graph
Drawing and Network VisualizationLNCS vol. 12590, 359–371.'
mla: Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International
Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer
Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.
short: J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing
and Network Visualization, Springer Nature, 2020, pp. 359–371.
conference:
end_date: 2020-09-18
location: Virtual, Online
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2020-09-16
date_created: 2021-03-28T22:01:44Z
date_published: 2020-09-20T00:00:00Z
date_updated: 2025-04-15T07:16:52Z
day: '20'
department:
- _id: HeEd
doi: 10.1007/978-3-030-68766-3_28
external_id:
arxiv:
- '2006.14908'
intvolume: ' 12590'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2006.14908
month: '09'
oa: 1
oa_version: Preprint
page: 359-371
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: 28th International Symposium on Graph Drawing and Network Visualization
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030687656'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Crossings between non-homotopic edges
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12590
year: '2020'
...
---
_id: '9308'
acknowledgement: This research was carried out with the support of the Russian Foundation
for Basic Research(grant no. 19-01-00169)
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: A. B.
full_name: Skopenkov, A. B.
last_name: Skopenkov
citation:
ama: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity
intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158.
doi:10.1070/RM9943
apa: Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating
higher-multiplicity intersections, III. Codimension 2. Russian Mathematical
Surveys. IOP Publishing. https://doi.org/10.1070/RM9943
chicago: Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating
Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical
Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.
ieee: S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity
intersections, III. Codimension 2,” Russian Mathematical Surveys, vol.
75, no. 6. IOP Publishing, pp. 1156–1158, 2020.
ista: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity
intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.
mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III.
Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing,
2020, pp. 1156–58, doi:10.1070/RM9943.
short: S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical
Surveys 75 (2020) 1156–1158.
date_created: 2021-04-04T22:01:22Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2025-07-02T10:54:51Z
day: '01'
department:
- _id: UlWa
doi: 10.1070/RM9943
external_id:
arxiv:
- '1511.03501'
isi:
- '000625983100001'
intvolume: ' 75'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03501
month: '12'
oa: 1
oa_version: Preprint
page: 1156-1158
publication: Russian Mathematical Surveys
publication_identifier:
issn:
- 0036-0279
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10220'
relation: later_version
status: public
- id: '8183'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Eliminating higher-multiplicity intersections, III. Codimension 2
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 75
year: '2020'
...
---
_id: '9326'
abstract:
- lang: eng
text: The mitochondrial respiratory chain, formed by five protein complexes, utilizes
energy from catabolic processes to synthesize ATP. Complex I, the first and the
largest protein complex of the chain, harvests electrons from NADH to reduce quinone,
while pumping protons across the mitochondrial membrane. Detailed knowledge of
the working principle of such coupled charge-transfer processes remains, however,
fragmentary due to bottlenecks in understanding redox-driven conformational transitions
and their interplay with the hydrated proton pathways. Complex I from Thermus
thermophilus encases 16 subunits with nine iron–sulfur clusters, reduced by electrons
from NADH. Here, employing the latest crystal structure of T. thermophilus complex
I, we have used microsecond-scale molecular dynamics simulations to study the
chemo-mechanical coupling between redox changes of the iron–sulfur clusters and
conformational transitions across complex I. First, we identify the redox switches
within complex I, which allosterically couple the dynamics of the quinone binding
pocket to the site of NADH reduction. Second, our free-energy calculations reveal
that the affinity of the quinone, specifically menaquinone, for the binding-site
is higher than that of its reduced, menaquinol forma design essential for menaquinol
release. Remarkably, the barriers to diffusive menaquinone dynamics are lesser
than that of the more ubiquitous ubiquinone, and the naphthoquinone headgroup
of the former furnishes stronger binding interactions with the pocket, favoring
menaquinone for charge transport in T. thermophilus. Our computations are consistent
with experimentally validated mutations and hierarchize the key residues into
three functional classes, identifying new mutation targets. Third, long-range
hydrogen-bond networks connecting the quinone-binding site to the transmembrane
subunits are found to be responsible for proton pumping. Put together, the simulations
reveal the molecular design principles linking redox reactions to quinone turnover
to proton translocation in complex I.
article_processing_charge: No
author:
- first_name: Chitrak
full_name: Gupta, Chitrak
last_name: Gupta
- first_name: Umesh
full_name: Khaniya, Umesh
last_name: Khaniya
- first_name: Chun
full_name: Chan, Chun
last_name: Chan
- first_name: Francois
full_name: Dehez, Francois
last_name: Dehez
- first_name: Mrinal
full_name: Shekhar, Mrinal
last_name: Shekhar
- first_name: M. R.
full_name: Gunner, M. R.
last_name: Gunner
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Christophe
full_name: Chipot, Christophe
last_name: Chipot
- first_name: Abhishek
full_name: Singharoy, Abhishek
last_name: Singharoy
citation:
ama: Gupta C, Khaniya U, Chan C, et al. Charge transfer and chemo-mechanical coupling
in respiratory complex I. 2020. doi:10.1021/jacs.9b13450.s002
apa: Gupta, C., Khaniya, U., Chan, C., Dehez, F., Shekhar, M., Gunner, M. R., …
Singharoy, A. (2020). Charge transfer and chemo-mechanical coupling in respiratory
complex I. American Chemical Society. https://doi.org/10.1021/jacs.9b13450.s002
chicago: Gupta, Chitrak, Umesh Khaniya, Chun Chan, Francois Dehez, Mrinal Shekhar,
M. R. Gunner, Leonid A Sazanov, Christophe Chipot, and Abhishek Singharoy. “Charge
Transfer and Chemo-Mechanical Coupling in Respiratory Complex I.” American Chemical
Society, 2020. https://doi.org/10.1021/jacs.9b13450.s002.
ieee: C. Gupta et al., “Charge transfer and chemo-mechanical coupling in
respiratory complex I.” American Chemical Society, 2020.
ista: Gupta C, Khaniya U, Chan C, Dehez F, Shekhar M, Gunner MR, Sazanov LA, Chipot
C, Singharoy A. 2020. Charge transfer and chemo-mechanical coupling in respiratory
complex I, American Chemical Society, 10.1021/jacs.9b13450.s002.
mla: Gupta, Chitrak, et al. Charge Transfer and Chemo-Mechanical Coupling in
Respiratory Complex I. American Chemical Society, 2020, doi:10.1021/jacs.9b13450.s002.
short: C. Gupta, U. Khaniya, C. Chan, F. Dehez, M. Shekhar, M.R. Gunner, L.A. Sazanov,
C. Chipot, A. Singharoy, (2020).
date_created: 2021-04-14T12:05:20Z
date_published: 2020-05-20T00:00:00Z
date_updated: 2025-07-10T11:55:01Z
day: '20'
department:
- _id: LeSa
doi: 10.1021/jacs.9b13450.s002
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '05'
oa_version: Published Version
publisher: American Chemical Society
related_material:
record:
- id: '8040'
relation: used_in_publication
status: public
status: public
title: Charge transfer and chemo-mechanical coupling in respiratory complex I
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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'
...
---
OA_place: publisher
OA_type: hybrid
_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: 2024-10-16T12:14:37Z
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: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
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'
...
---
OA_place: publisher
OA_type: hybrid
_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: 2024-10-16T12:20:07Z
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: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
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'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_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: 2024-10-16T12:26:40Z
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
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: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
volume: 8
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)."
alternative_title:
- Advances in Neural Information Processing Systems
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: Vol 33. Neural Information Processing Systems Foundation; 2020:22361-22372.'
apa: 'Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation
via relaxed scheduling (Vol. 33, pp. 22361–22372). Presented at the NeurIPS: Conference
on Neural Information Processing Systems, Vancouver, Canada: Neural Information
Processing Systems Foundation.'
chicago: Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief
Propagation via Relaxed Scheduling,” 33:22361–72. Neural Information Processing
Systems Foundation, 2020.
ieee: 'V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation
via relaxed scheduling,” presented at the NeurIPS: Conference on 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. NeurIPS: Conference on Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 33, 22361–22372.'
mla: Aksenov, Vitaly, et al. Scalable Belief Propagation via Relaxed Scheduling.
Vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 22361–72.
short: V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Neural Information Processing
Systems Foundation, 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
corr_author: '1'
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2025-05-14T11:27:33Z
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_identifier:
isbn:
- '9781713829546'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scalable belief propagation via relaxed scheduling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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.
alternative_title:
- Advances in Neural Information Processing Systems
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: Vol 33. Neural Information Processing Systems
Foundation; 2020:18098-18109.'
apa: 'Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order
approximation for neural network compression (Vol. 33, pp. 18098–18109). Presented
at the NeurIPS: Conference on Neural Information Processing Systems, Vancouver,
Canada: Neural Information Processing Systems Foundation.'
chicago: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order
Approximation for Neural Network Compression,” 33:18098–109. Neural Information
Processing Systems Foundation, 2020.'
ieee: 'S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation
for neural network compression,” presented at the NeurIPS: Conference on 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. NeurIPS: Conference on Neural Information Processing
Systems, Advances in 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. Vol. 33, Neural Information
Processing Systems Foundation, 2020, pp. 18098–109.'
short: S.P. Singh, D.-A. Alistarh, in:, Neural Information Processing Systems Foundation,
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
corr_author: '1'
date_created: 2021-07-04T22:01:26Z
date_published: 2020-12-06T00:00:00Z
date_updated: 2025-05-14T11:27:23Z
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_identifier:
isbn:
- '9781713829546'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'WoodFisher: Efficient second-order approximation for neural network compression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2020'
...