---
_id: '2140'
abstract:
- lang: eng
text: We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein
condensates with non-local interactions. The scheme relies on the use of momentum-dependent
dark-states in close analogy to velocity-selective coherent population trapping.
During the short-time dissipative dynamics, the system is driven into a particular
finite-momentum phonon mode, which in real space corresponds to an ordered structure
with non-local density-density correlations. Dissipation-induced ordering can
be observed and studied in present-day experiments using cold atoms with dipole-dipole
or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering
does not require artificial breaking of translational symmetry by an opticallattice
or harmonic trap. This opens up a perspective of direct cooling of quantum gases
into strongly-interacting phases.
acknowledgement: This work was supported by NSF through a grant for the Institute
for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and
Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center.
article_number: '070401'
author:
- first_name: Johannes
full_name: Otterbach, Johannes
last_name: Otterbach
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed
Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401
apa: Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial
order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401
chicago: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of
Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review
Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401.
ieee: J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in
Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol.
113, no. 7. American Physical Society, 2014.
ista: Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in
Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401.
mla: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial
Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters,
vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401.
short: J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014).
date_created: 2018-12-11T11:55:56Z
date_published: 2014-08-11T00:00:00Z
date_updated: 2021-01-12T06:55:33Z
day: '11'
doi: 10.1103/PhysRevLett.113.070401
extern: '1'
intvolume: ' 113'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1308.5905
month: '08'
oa: 1
oa_version: Submitted Version
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '4884'
status: public
title: Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2014'
...
---
_id: '2153'
abstract:
- lang: eng
text: 'We define a simple, explicit map sending a morphism f : M → N of pointwise
finite dimensional persistence modules to a matching between the barcodes of M
and N. Our main result is that, in a precise sense, the quality of this matching
is tightly controlled by the lengths of the longest intervals in the barcodes
of ker f and coker f . As an immediate corollary, we obtain a new proof of the
algebraic stability theorem for persistence barcodes [5, 9], a fundamental result
in the theory of persistent homology. In contrast to previous proofs, ours shows
explicitly how a δ-interleaving morphism between two persistence modules induces
a δ-matching between the barcodes of the two modules. Our main result also specializes
to a structure theorem for submodules and quotients of persistence modules. Copyright
is held by the owner/author(s).'
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Michael
full_name: Lesnick, Michael
last_name: Lesnick
citation:
ama: 'Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability
of persistence. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:355-364. doi:10.1145/2582112.2582168'
apa: 'Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the
algebraic stability of persistence. In Proceedings of the Annual Symposium
on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168'
chicago: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and
the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium
on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.
ieee: U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic
stability of persistence,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 355–364.
ista: 'Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic
stability of persistence. Proceedings of the Annual Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, 355–364.'
mla: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the
Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on
Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.
short: U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 355–364.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:38Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582168
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.3681
month: '06'
oa: 1
oa_version: Submitted Version
page: 355 - 364
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4853'
quality_controlled: '1'
scopus_import: 1
status: public
title: Induced matchings of barcodes and the algebraic stability of persistence
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2154'
abstract:
- lang: eng
text: A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that
for every d there exists cd > 0 such that for every n-point set P ⊂ ℝd, some
point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned
by the points of P. The largest possible value of cd has been the subject of ongoing
research. Recently Gromov improved the existing lower bounds considerably by introducing
a new, topological proof method. We provide an exposition of the combinatorial
component of Gromov's approach, in terms accessible to combinatorialists and discrete
geometers, and we investigate the limits of his method. In particular, we give
tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds
yield a minor improvement over Gromov's lower bounds on cd for large d, but they
also show that the room for further improvement through the cofilling profiles
alone is quite small. We also prove a slightly better lower bound for c3 by an
approach using an additional structure besides the cofilling profiles. We formulate
a combinatorial extremal problem whose solution might perhaps lead to a tight
lower bound for cd.
acknowledgement: Swiss National Science Foundation (SNF 200021-125309, 200020-138230,
200020-12507)
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points.
Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7
apa: Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily
covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7
chicago: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily
Covered Points.” Discrete & Computational Geometry. Springer, 2014.
https://doi.org/10.1007/s00454-014-9584-7.
ieee: J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered
points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer,
pp. 1–33, 2014.
ista: Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered
points. Discrete & Computational Geometry. 52(1), 1–33.
mla: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered
Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer,
2014, pp. 1–33, doi:10.1007/s00454-014-9584-7.
short: J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.
date_created: 2018-12-11T11:56:01Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2021-01-12T06:55:38Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-014-9584-7
intvolume: ' 52'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.3515
month: '07'
oa: 1
oa_version: Submitted Version
page: 1 - 33
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '4852'
quality_controlled: '1'
scopus_import: 1
status: public
title: On Gromov's method of selecting heavily covered points
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2014'
...
---
_id: '2156'
abstract:
- lang: eng
text: We propose a metric for Reeb graphs, called the functional distortion distance.
Under this distance, the Reeb graph is stable against small changes of input functions.
At the same time, it remains discriminative at differentiating input functions.
In particular, the main result is that the functional distortion distance between
two Reeb graphs is bounded from below by the bottleneck distance between both
the ordinary and extended persistence diagrams for appropriate dimensions. As
an application of our results, we analyze a natural simplification scheme for
Reeb graphs, and show that persistent features in Reeb graph remains persistent
under simplification. Understanding the stability of important features of the
Reeb graph under simplification is an interesting problem on its own right, and
critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).
acknowledgement: National Science Foundation under grants CCF-1319406, CCF-1116258.
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Xiaoyin
full_name: Ge, Xiaoyin
last_name: Ge
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: 'Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings
of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169'
apa: 'Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb
graphs. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169'
chicago: Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb
Graphs.” In Proceedings of the Annual Symposium on Computational Geometry,
464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.
ieee: U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in
Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan,
2014, pp. 464–473.
ista: 'Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings
of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, 464–473.'
mla: Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings
of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73,
doi:10.1145/2582112.2582169.
short: U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 464–473.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:02Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:39Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582169
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.2839
month: '06'
oa: 1
oa_version: Submitted Version
page: 464 - 473
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4850'
quality_controlled: '1'
scopus_import: 1
status: public
title: Measuring distance between Reeb graphs
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2155'
abstract:
- lang: eng
text: Given a finite set of points in Rn and a positive radius, we study the Čech,
Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete
Morse theory. We prove that the latter three complexes are simple-homotopy equivalent.
Our results have applications in topological data analysis and in the reconstruction
of shapes from sampled data. Copyright is held by the owner/author(s).
acknowledgement: This research is partially supported by ESF under the ACAT Research
Network Programme, and by the Russian Government under mega project 11.G34.31.0053
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations.
In: Proceedings of the Annual Symposium on Computational Geometry. ACM;
2014:484-490. doi:10.1145/2582112.2582167'
apa: 'Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay
filtrations. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167'
chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational
Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.
ieee: U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,”
in Proceedings of the Annual Symposium on Computational Geometry, Kyoto,
Japan, 2014, pp. 484–490.
ista: 'Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations.
Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium
on Computational Geometry, 484–490.'
mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
Filtrations.” Proceedings of the Annual Symposium on Computational Geometry,
ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
short: U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 484–490.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:38Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582167
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1312.1231
month: '06'
oa: 1
oa_version: Submitted Version
page: 484 - 490
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4851'
quality_controlled: '1'
scopus_import: 1
status: public
title: The morse theory of Čech and Delaunay filtrations
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2158'
abstract:
- lang: eng
text: Directional guidance of migrating cells is relatively well explored in the
reductionist setting of cell culture experiments. Here spatial gradients of chemical
cues as well as gradients of mechanical substrate characteristics prove sufficient
to attract single cells as well as their collectives. How such gradients present
and act in the context of an organism is far less clear. Here we review recent
advances in understanding how guidance cues emerge and operate in the physiological
context.
acknowledgement: This effort was supported by the Intramural Research Program of the
Center for Cancer Research, NCI, National Institutes of Health and the European
Research Council (ERC).
author:
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Carole
full_name: Parent, Carole
last_name: Parent
citation:
ama: Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance
of gradients during directed cell migration. Current Opinion in Cell Biology.
2014;30(1):33-40. doi:10.1016/j.ceb.2014.05.010
apa: Majumdar, R., Sixt, M. K., & Parent, C. (2014). New paradigms in the establishment
and maintenance of gradients during directed cell migration. Current Opinion
in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2014.05.010
chicago: Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in
the Establishment and Maintenance of Gradients during Directed Cell Migration.”
Current Opinion in Cell Biology. Elsevier, 2014. https://doi.org/10.1016/j.ceb.2014.05.010.
ieee: R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment
and maintenance of gradients during directed cell migration,” Current Opinion
in Cell Biology, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.
ista: Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and
maintenance of gradients during directed cell migration. Current Opinion in Cell
Biology. 30(1), 33–40.
mla: Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance
of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology,
vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:10.1016/j.ceb.2014.05.010.
short: R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014)
33–40.
date_created: 2018-12-11T11:56:03Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:40Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2014.05.010
external_id:
pmid:
- '24959970'
intvolume: ' 30'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/
month: '10'
oa: 1
oa_version: Submitted Version
page: 33 - 40
pmid: 1
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '4848'
quality_controlled: '1'
scopus_import: 1
status: public
title: New paradigms in the establishment and maintenance of gradients during directed
cell migration
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2014'
...
---
_id: '2165'
abstract:
- lang: eng
text: 'In machine learning, the domain adaptation problem arrives when the test
(tar-get) and the train (source) data are generated from different distributions. A
key applied issue is thus the design of algorithms able to generalize on a new
distribution, for which we have no label information. We focus on learning classification
models defined as a weighted majority vote over a set of real-valued functions.
In this context, Germain et al. (2013) have shown that a measure of disagreement
between these functions is crucial to control. The core of this measure is a theoretical
bound—the C-bound (Lacasse et al., 2007)—which involves the disagreement and leads
to a well performing majority vote learn-ing algorithm in usual non-adaptative
supervised setting: MinCq. In this work,we propose a framework to extend MinCq
to a domain adaptation scenario.This procedure takes advantage of the recent perturbed
variation divergence between distributions proposed by Harel and Mannor (2012). Justified
by a theoretical bound on the target risk of the vote, we provide to MinCq a
tar-get sample labeled thanks to a perturbed variation-based self-labeling focused
on the regions where the source and target marginals appear similar. We also
study the influence of our self-labeling, from which we deduce an original process
for tuning the hyperparameters. Finally, our framework called PV-MinCq shows very
promising results on a rotation and translation synthetic problem.'
author:
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
citation:
ama: Morvant E. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based
Self-Labeling. Pattern Recognition Letters. 2014;51:37-43. doi:10.1016/j.patrec.2014.08.013
apa: Morvant, E. (2014). Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2014.08.013
chicago: Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling.” Pattern Recognition Letters. Elsevier,
2014. https://doi.org/10.1016/j.patrec.2014.08.013.
ieee: E. Morvant, “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based
Self-Labeling,” Pattern Recognition Letters, vol. 51. Elsevier, pp. 37–43,
2014.
ista: Morvant E. 2014. Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling. Pattern Recognition Letters. 51, 37–43.
mla: Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed
Variation-Based Self-Labeling.” Pattern Recognition Letters, vol. 51, Elsevier,
2014, pp. 37–43, doi:10.1016/j.patrec.2014.08.013.
short: E. Morvant, Pattern Recognition Letters 51 (2014) 37–43.
date_created: 2018-12-11T11:56:05Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:43Z
day: '01'
doi: 10.1016/j.patrec.2014.08.013
ec_funded: 1
extern: '1'
intvolume: ' 51'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.0334
month: '10'
oa: 1
oa_version: Submitted Version
page: 37-43
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Pattern Recognition Letters
publication_status: published
publisher: Elsevier
publist_id: '4819'
quality_controlled: '1'
status: public
title: Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based
Self-Labeling
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_id: '2164'
abstract:
- lang: eng
text: 'Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe
epilepsy (TLE), has been assumed to result from a migration defect during development.
Indeed, recent studies reported that aberrant migration of neonatal-generated
dentate granule cells (GCs) increased the risk to develop epilepsy later in life.
On the contrary, in the present study, we show that fully differentiated GCs become
motile following the induction of epileptiform activity, resulting in GCD. Hippocampal
slice cultures from transgenic mice expressing green fluorescent protein in differentiated,
but not in newly generated GCs, were incubated with the glutamate receptor agonist
kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy,
we observed that KA-exposed, differentiated GCs translocated their cell bodies
and changed their dendritic organization. As found in human TLE, KA application
was associated with decreased expression of the extracellular matrix protein Reelin,
particularly in hilar interneurons. Together these findings suggest that KA-induced
motility of differentiated GCs contributes to the development of GCD and establish
slice cultures as a model to study neuronal changes induced by epileptiform activity. '
author:
- first_name: Xuejun
full_name: Chai, Xuejun
last_name: Chai
- first_name: Gert
full_name: Münzner, Gert
last_name: Münzner
- first_name: Shanting
full_name: Zhao, Shanting
last_name: Zhao
- first_name: Stefanie
full_name: Tinnes, Stefanie
last_name: Tinnes
- first_name: Janina
full_name: Kowalski, Janina
id: 3F3CA136-F248-11E8-B48F-1D18A9856A87
last_name: Kowalski
- first_name: Ute
full_name: Häussler, Ute
last_name: Häussler
- first_name: Christina
full_name: Young, Christina
last_name: Young
- first_name: Carola
full_name: Haas, Carola
last_name: Haas
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
citation:
ama: Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated
neurons. Cerebral Cortex. 2014;24(8):2130-2140. doi:10.1093/cercor/bht067
apa: Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., …
Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. Cerebral
Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bht067
chicago: Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski,
Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced
Motility of Differentiated Neurons.” Cerebral Cortex. Oxford University
Press, 2014. https://doi.org/10.1093/cercor/bht067.
ieee: X. Chai et al., “Epilepsy-induced motility of differentiated neurons,”
Cerebral Cortex, vol. 24, no. 8. Oxford University Press, pp. 2130–2140,
2014.
ista: Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas
C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral
Cortex. 24(8), 2130–2140.
mla: Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.”
Cerebral Cortex, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40,
doi:10.1093/cercor/bht067.
short: X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young,
C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.
date_created: 2018-12-11T11:56:04Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:43Z
day: '01'
department:
- _id: PeJo
doi: 10.1093/cercor/bht067
intvolume: ' 24'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 2130 - 2140
publication: Cerebral Cortex
publication_status: published
publisher: Oxford University Press
publist_id: '4820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Epilepsy-induced motility of differentiated neurons
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2014'
...
---
_id: '2168'
abstract:
- lang: eng
text: Many species have an essentially continuous distribution in space, in which
there are no natural divisions between randomly mating subpopulations. Yet, the
standard approach to modelling these populations is to impose an arbitrary grid
of demes, adjusting deme sizes and migration rates in an attempt to capture the
important features of the population. Such indirect methods are required because
of the failure of the classical models of isolation by distance, which have been
shown to have major technical flaws. A recently introduced model of extinction
and recolonisation in two dimensions solves these technical problems, and provides
a rigorous technical foundation for the study of populations evolving in a spatial
continuum. The coalescent process for this model is simply stated, but direct
simulation is very inefficient for large neighbourhood sizes. We present efficient
and exact algorithms to simulate this coalescent process for arbitrary sample
sizes and numbers of loci, and analyse these algorithms in detail.
author:
- first_name: Jerome
full_name: Kelleher, Jerome
last_name: Kelleher
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Kelleher J, Etheridge A, Barton NH. Coalescent simulation in continuous space:
Algorithms for large neighbourhood size. Theoretical Population Biology.
2014;95:13-23. doi:10.1016/j.tpb.2014.05.001'
apa: 'Kelleher, J., Etheridge, A., & Barton, N. H. (2014). Coalescent simulation
in continuous space: Algorithms for large neighbourhood size. Theoretical Population
Biology. Academic Press. https://doi.org/10.1016/j.tpb.2014.05.001'
chicago: 'Kelleher, Jerome, Alison Etheridge, and Nicholas H Barton. “Coalescent
Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical
Population Biology. Academic Press, 2014. https://doi.org/10.1016/j.tpb.2014.05.001.'
ieee: 'J. Kelleher, A. Etheridge, and N. H. Barton, “Coalescent simulation in continuous
space: Algorithms for large neighbourhood size,” Theoretical Population Biology,
vol. 95. Academic Press, pp. 13–23, 2014.'
ista: 'Kelleher J, Etheridge A, Barton NH. 2014. Coalescent simulation in continuous
space: Algorithms for large neighbourhood size. Theoretical Population Biology.
95, 13–23.'
mla: 'Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space: Algorithms
for Large Neighbourhood Size.” Theoretical Population Biology, vol. 95,
Academic Press, 2014, pp. 13–23, doi:10.1016/j.tpb.2014.05.001.'
short: J. Kelleher, A. Etheridge, N.H. Barton, Theoretical Population Biology 95
(2014) 13–23.
date_created: 2018-12-11T11:56:06Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:44Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2014.05.001
ec_funded: 1
file:
- access_level: open_access
checksum: 979d7a8034e9df198f068f0d251f31bd
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:49Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4839'
file_name: IST-2015-391-v1+1_1-s2.0-S0040580914000355-main.pdf
file_size: 569005
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 95'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 13 - 23
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '4816'
pubrep_id: '391'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Coalescent simulation in continuous space: Algorithms for large neighbourhood
size'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2014'
...
---
_id: '2169'
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Barton NH, Novak S, Paixao T. Diverse forms of selection in evolution and computer
science. PNAS. 2014;111(29):10398-10399. doi:10.1073/pnas.1410107111
apa: Barton, N. H., Novak, S., & Paixao, T. (2014). Diverse forms of selection
in evolution and computer science. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.1410107111
chicago: Barton, Nicholas H, Sebastian Novak, and Tiago Paixao. “Diverse Forms of
Selection in Evolution and Computer Science.” PNAS. National Academy of
Sciences, 2014. https://doi.org/10.1073/pnas.1410107111.
ieee: N. H. Barton, S. Novak, and T. Paixao, “Diverse forms of selection in evolution
and computer science,” PNAS, vol. 111, no. 29. National Academy of Sciences,
pp. 10398–10399, 2014.
ista: Barton NH, Novak S, Paixao T. 2014. Diverse forms of selection in evolution
and computer science. PNAS. 111(29), 10398–10399.
mla: Barton, Nicholas H., et al. “Diverse Forms of Selection in Evolution and Computer
Science.” PNAS, vol. 111, no. 29, National Academy of Sciences, 2014, pp.
10398–99, doi:10.1073/pnas.1410107111.
short: N.H. Barton, S. Novak, T. Paixao, PNAS 111 (2014) 10398–10399.
date_created: 2018-12-11T11:56:07Z
date_published: 2014-07-22T00:00:00Z
date_updated: 2021-01-12T06:55:45Z
day: '22'
department:
- _id: NiBa
doi: 10.1073/pnas.1410107111
intvolume: ' 111'
issue: '29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115508/
month: '07'
oa: 1
oa_version: Submitted Version
page: 10398 - 10399
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '4815'
quality_controlled: '1'
scopus_import: 1
status: public
title: Diverse forms of selection in evolution and computer science
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 111
year: '2014'
...
---
_id: '2171'
abstract:
- lang: eng
text: We present LS-CRF, a new method for training cyclic Conditional Random Fields
(CRFs) from large datasets that is inspired by classical closed-form expressions
for the maximum likelihood parameters of a generative graphical model with tree
topology. Training a CRF with LS-CRF requires only solving a set of independent
regression problems, each of which can be solved efficiently in closed form or
by an iterative solver. This makes LS-CRF orders of magnitude faster than classical
CRF training based on probabilistic inference, and at the same time more flexible
and easier to implement than other approximate techniques, such as pseudolikelihood
or piecewise training. We apply LS-CRF to the task of semantic image segmentation,
showing that it achieves on par accuracy to other training techniques at higher
speed, thereby allowing efficient CRF training from very large training sets.
For example, training a linearly parameterized pairwise CRF on 150,000 images
requires less than one hour on a modern workstation.
alternative_title:
- LNCS
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Matthieu
full_name: Guillaumin, Matthieu
last_name: Guillaumin
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. Closed-form approximate
CRF training for scalable image segmentation. In: Fleet D, Pajdla T, Schiele B,
Tuytelaars T, eds. Lecture Notes in Computer Science (Including Subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol
8691. Springer; 2014:550-565. doi:10.1007/978-3-319-10578-9_36'
apa: 'Kolesnikov, A., Guillaumin, M., Ferrari, V., & Lampert, C. (2014). Closed-form
approximate CRF training for scalable image segmentation. In D. Fleet, T. Pajdla,
B. Schiele, & T. Tuytelaars (Eds.), Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8691, pp. 550–565). Zurich, Switzerland: Springer. https://doi.org/10.1007/978-3-319-10578-9_36'
chicago: Kolesnikov, Alexander, Matthieu Guillaumin, Vittorio Ferrari, and Christoph
Lampert. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.”
In Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David
Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, 8691:550–65. Springer,
2014. https://doi.org/10.1007/978-3-319-10578-9_36.
ieee: A. Kolesnikov, M. Guillaumin, V. Ferrari, and C. Lampert, “Closed-form approximate
CRF training for scalable image segmentation,” in Lecture Notes in Computer
Science (including subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Zurich, Switzerland, 2014, vol. 8691, no. PART 3,
pp. 550–565.
ista: 'Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. 2014. Closed-form approximate
CRF training for scalable image segmentation. Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics). ECCV: European Conference on Computer Vision, LNCS, vol. 8691,
550–565.'
mla: Kolesnikov, Alexander, et al. “Closed-Form Approximate CRF Training for Scalable
Image Segmentation.” Lecture Notes in Computer Science (Including Subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by David Fleet et al., vol. 8691, no. PART 3, Springer, 2014, pp. 550–65,
doi:10.1007/978-3-319-10578-9_36.
short: A. Kolesnikov, M. Guillaumin, V. Ferrari, C. Lampert, in:, D. Fleet, T. Pajdla,
B. Schiele, T. Tuytelaars (Eds.), Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Springer, 2014, pp. 550–565.
conference:
end_date: 2014-09-12
location: Zurich, Switzerland
name: 'ECCV: European Conference on Computer Vision'
start_date: 2014-09-06
date_created: 2018-12-11T11:56:07Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-319-10578-9_36
ec_funded: 1
editor:
- first_name: David
full_name: Fleet, David
last_name: Fleet
- first_name: Tomas
full_name: Pajdla, Tomas
last_name: Pajdla
- first_name: Bernt
full_name: Schiele, Bernt
last_name: Schiele
- first_name: Tinne
full_name: Tuytelaars, Tinne
last_name: Tuytelaars
intvolume: ' 8691'
issue: PART 3
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1403.7057
month: '09'
oa: 1
oa_version: Submitted Version
page: 550 - 565
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '4813'
quality_controlled: '1'
scopus_import: 1
status: public
title: Closed-form approximate CRF training for scalable image segmentation
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8691
year: '2014'
...
---
_id: '2173'
abstract:
- lang: eng
text: "In this work we introduce a new approach to co-classification, i.e. the task
of jointly classifying multiple, otherwise independent, data samples. The method
we present, named CoConut, is based on the idea of adding a regularizer in the
label space to encode certain priors on the resulting labelings. A regularizer
that encourages labelings that are smooth across the test set, for instance, can
be seen as a test-time variant of the cluster assumption, which has been proven
useful at training time in semi-supervised learning. A regularizer that introduces
a preference for certain class proportions can be regarded as a prior distribution
on the class labels. CoConut can build on existing classifiers without making
any assumptions on how they were obtained and without the need to re-train them.
The use of a regularizer adds a new level of flexibility. It allows the integration
of potentially new information at test time, even in other modalities than what
the classifiers were trained on. We evaluate our framework on six datasets, reporting
a clear performance gain in classification accuracy compared to the standard classification
setup that predicts labels for each test sample separately.\r\n"
author:
- first_name: Sameh
full_name: Khamis, Sameh
last_name: Khamis
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Khamis S, Lampert C. CoConut: Co-classification with output space regularization.
In: Proceedings of the British Machine Vision Conference 2014. BMVA Press;
2014.'
apa: 'Khamis, S., & Lampert, C. (2014). CoConut: Co-classification with output
space regularization. In Proceedings of the British Machine Vision Conference
2014. Nottingham, UK: BMVA Press.'
chicago: 'Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with
Output Space Regularization.” In Proceedings of the British Machine Vision
Conference 2014. BMVA Press, 2014.'
ieee: 'S. Khamis and C. Lampert, “CoConut: Co-classification with output space regularization,”
in Proceedings of the British Machine Vision Conference 2014, Nottingham,
UK, 2014.'
ista: 'Khamis S, Lampert C. 2014. CoConut: Co-classification with output space regularization.
Proceedings of the British Machine Vision Conference 2014. BMVC: British Machine
Vision Conference.'
mla: 'Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output
Space Regularization.” Proceedings of the British Machine Vision Conference
2014, BMVA Press, 2014.'
short: S. Khamis, C. Lampert, in:, Proceedings of the British Machine Vision Conference
2014, BMVA Press, 2014.
conference:
end_date: 2014-09-05
location: Nottingham, UK
name: 'BMVC: British Machine Vision Conference'
start_date: 2014-09-01
date_created: 2018-12-11T11:56:08Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
ec_funded: 1
file:
- access_level: open_access
checksum: c4c6d3efdb8ee648faf3e76849839ce2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:23Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4683'
file_name: IST-2016-490-v1+1_khamis-bmvc2014.pdf
file_size: 408172
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the British Machine Vision Conference 2014
publication_status: published
publisher: BMVA Press
publist_id: '4811'
pubrep_id: '490'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'CoConut: Co-classification with output space regularization'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2172'
abstract:
- lang: eng
text: Fisher Kernels and Deep Learning were two developments with significant impact
on large-scale object categorization in the last years. Both approaches were shown
to achieve state-of-the-art results on large-scale object categorization datasets,
such as ImageNet. Conceptually, however, they are perceived as very different
and it is not uncommon for heated debates to spring up when advocates of both
paradigms meet at conferences or workshops. In this work, we emphasize the similarities
between both architectures rather than their differences and we argue that such
a unified view allows us to transfer ideas from one domain to the other. As a
concrete example we introduce a method for learning a support vector machine classifier
with Fisher kernel at the same time as a task-specific data representation. We
reinterpret the setting as a multi-layer feed forward network. Its final layer
is the classifier, parameterized by a weight vector, and the two previous layers
compute Fisher vectors, parameterized by the coefficients of a Gaussian mixture
model. We introduce a gradient descent based learning algorithm that, in contrast
to other feature learning techniques, is not just derived from intuition or biological
analogy, but has a theoretical justification in the framework of statistical learning
theory. Our experiments show that the new training procedure leads to significant
improvements in classification accuracy while preserving the modularity and geometric
interpretability of a support vector machine setup.
author:
- first_name: Vladyslav
full_name: Sydorov, Vladyslav
last_name: Sydorov
- first_name: Mayu
full_name: Sakurada, Mayu
last_name: Sakurada
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sydorov V, Sakurada M, Lampert C. Deep Fisher Kernels – End to end learning
of the Fisher Kernel GMM parameters. In: Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition. IEEE; 2014:1402-1409.
doi:10.1109/CVPR.2014.182'
apa: 'Sydorov, V., Sakurada, M., & Lampert, C. (2014). Deep Fisher Kernels –
End to end learning of the Fisher Kernel GMM parameters. In Proceedings of
the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
(pp. 1402–1409). Columbus, USA: IEEE. https://doi.org/10.1109/CVPR.2014.182'
chicago: Sydorov, Vladyslav, Mayu Sakurada, and Christoph Lampert. “Deep Fisher
Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” In Proceedings
of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition,
1402–9. IEEE, 2014. https://doi.org/10.1109/CVPR.2014.182.
ieee: V. Sydorov, M. Sakurada, and C. Lampert, “Deep Fisher Kernels – End to end
learning of the Fisher Kernel GMM parameters,” in Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition, Columbus, USA,
2014, pp. 1402–1409.
ista: 'Sydorov V, Sakurada M, Lampert C. 2014. Deep Fisher Kernels – End to end
learning of the Fisher Kernel GMM parameters. Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition. CVPR: Computer
Vision and Pattern Recognition, 1402–1409.'
mla: Sydorov, Vladyslav, et al. “Deep Fisher Kernels – End to End Learning of the
Fisher Kernel GMM Parameters.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–09, doi:10.1109/CVPR.2014.182.
short: V. Sydorov, M. Sakurada, C. Lampert, in:, Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp.
1402–1409.
conference:
end_date: 2014-06-28
location: Columbus, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2014-06-23
date_created: 2018-12-11T11:56:08Z
date_published: 2014-09-24T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '24'
department:
- _id: ChLa
doi: 10.1109/CVPR.2014.182
ec_funded: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 1402 - 1409
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_status: published
publisher: IEEE
publist_id: '4812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2174'
abstract:
- lang: eng
text: 'When polygenic traits are under stabilizing selection, many different combinations
of alleles allow close adaptation to the optimum. If alleles have equal effects,
all combinations that result in the same deviation from the optimum are equivalent.
Furthermore, the genetic variance that is maintained by mutation-selection balance
is 2μ/S per locus, where μ is the mutation rate and S the strength of stabilizing
selection. In reality, alleles vary in their effects, making the fitness landscape
asymmetric and complicating analysis of the equilibria. We show that that the
resulting genetic variance depends on the fraction of alleles near fixation, which
contribute by 2μ/S, and on the total mutational effects of alleles that are at
intermediate frequency. The inpplayfi between stabilizing selection and mutation
leads to a sharp transition: alleles with effects smaller than a threshold value
of 2 remain polymorphic, whereas those with larger effects are fixed. The genetic
load in equilibrium is less than for traits of equal effects, and the fitness
equilibria are more similar. We find p the optimum is displaced, alleles with
effects close to the threshold value sweep first, and their rate of increase is
bounded by Long-term response leads in general to well-adapted traits, unlike
the case of equal effects that often end up at a suboptimal fitness peak. However,
the particular peaks to which the populations converge are extremely sensitive
to the initial states and to the speed of the shift of the optimum trait value.'
author:
- first_name: Harold
full_name: De Vladar, Harold
last_name: De Vladar
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: De Vladar H, Barton NH. Stability and response of polygenic traits to stabilizing
selection and mutation. Genetics. 2014;197(2):749-767. doi:10.1534/genetics.113.159111
apa: De Vladar, H., & Barton, N. H. (2014). Stability and response of polygenic
traits to stabilizing selection and mutation. Genetics. Genetics Society
of America. https://doi.org/10.1534/genetics.113.159111
chicago: De Vladar, Harold, and Nicholas H Barton. “Stability and Response of Polygenic
Traits to Stabilizing Selection and Mutation.” Genetics. Genetics Society
of America, 2014. https://doi.org/10.1534/genetics.113.159111.
ieee: H. De Vladar and N. H. Barton, “Stability and response of polygenic traits
to stabilizing selection and mutation,” Genetics, vol. 197, no. 2. Genetics
Society of America, pp. 749–767, 2014.
ista: De Vladar H, Barton NH. 2014. Stability and response of polygenic traits to
stabilizing selection and mutation. Genetics. 197(2), 749–767.
mla: De Vladar, Harold, and Nicholas H. Barton. “Stability and Response of Polygenic
Traits to Stabilizing Selection and Mutation.” Genetics, vol. 197, no.
2, Genetics Society of America, 2014, pp. 749–67, doi:10.1534/genetics.113.159111.
short: H. De Vladar, N.H. Barton, Genetics 197 (2014) 749–767.
date_created: 2018-12-11T11:56:08Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:47Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.113.159111
ec_funded: 1
intvolume: ' 197'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.1017
month: '06'
oa: 1
oa_version: Submitted Version
page: 749 - 767
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '4809'
quality_controlled: '1'
scopus_import: 1
status: public
title: Stability and response of polygenic traits to stabilizing selection and mutation
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 197
year: '2014'
...
---
_id: '2179'
abstract:
- lang: eng
text: We extend the proof of the local semicircle law for generalized Wigner matrices
given in MR3068390 to the case when the matrix of variances has an eigenvalue
-1. In particular, this result provides a short proof of the optimal local Marchenko-Pastur
law at the hard edge (i.e. around zero) for sample covariance matrices X*X, where
the variances of the entries of X may vary.
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Ajanki OH, Erdös L, Krüger TH. Local semicircle law with imprimitive variance
matrix. Electronic Communications in Probability. 2014;19. doi:10.1214/ECP.v19-3121
apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2014). Local semicircle law
with imprimitive variance matrix. Electronic Communications in Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/ECP.v19-3121
chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Semicircle
Law with Imprimitive Variance Matrix.” Electronic Communications in Probability.
Institute of Mathematical Statistics, 2014. https://doi.org/10.1214/ECP.v19-3121.
ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local semicircle law with imprimitive
variance matrix,” Electronic Communications in Probability, vol. 19. Institute
of Mathematical Statistics, 2014.
ista: Ajanki OH, Erdös L, Krüger TH. 2014. Local semicircle law with imprimitive
variance matrix. Electronic Communications in Probability. 19.
mla: Ajanki, Oskari H., et al. “Local Semicircle Law with Imprimitive Variance Matrix.”
Electronic Communications in Probability, vol. 19, Institute of Mathematical
Statistics, 2014, doi:10.1214/ECP.v19-3121.
short: O.H. Ajanki, L. Erdös, T.H. Krüger, Electronic Communications in Probability
19 (2014).
date_created: 2018-12-11T11:56:10Z
date_published: 2014-06-09T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '09'
ddc:
- '570'
department:
- _id: LaEr
doi: 10.1214/ECP.v19-3121
file:
- access_level: open_access
checksum: bd8a041c76d62fe820bf73ff13ce7d1b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:06Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4729'
file_name: IST-2016-426-v1+1_3121-17518-1-PB.pdf
file_size: 327322
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 19'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '4803'
pubrep_id: '426'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local semicircle law with imprimitive variance matrix
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2014'
...
---
_id: '2176'
abstract:
- lang: eng
text: Electron microscopy (EM) allows for the simultaneous visualization of all
tissue components at high resolution. However, the extent to which conventional
aldehyde fixation and ethanol dehydration of the tissue alter the fine structure
of cells and organelles, thereby preventing detection of subtle structural changes
induced by an experiment, has remained an issue. Attempts have been made to rapidly
freeze tissue to preserve native ultrastructure. Shock-freezing of living tissue
under high pressure (high-pressure freezing, HPF) followed by cryosubstitution
of the tissue water avoids aldehyde fixation and dehydration in ethanol; the tissue
water is immobilized in â ̂1/450 ms, and a close-to-native fine structure of cells,
organelles and molecules is preserved. Here we describe a protocol for HPF that
is useful to monitor ultrastructural changes associated with functional changes
at synapses in the brain but can be applied to many other tissues as well. The
procedure requires a high-pressure freezer and takes a minimum of 7 d but can
be paused at several points.
author:
- first_name: Daniel
full_name: Studer, Daniel
last_name: Studer
- first_name: Shanting
full_name: Zhao, Shanting
last_name: Zhao
- first_name: Xuejun
full_name: Chai, Xuejun
last_name: Chai
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Werner
full_name: Graber, Werner
last_name: Graber
- first_name: Sigrun
full_name: Nestel, Sigrun
last_name: Nestel
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
citation:
ama: Studer D, Zhao S, Chai X, et al. Capture of activity-induced ultrastructural
changes at synapses by high-pressure freezing of brain tissue. Nature Protocols.
2014;9(6):1480-1495. doi:10.1038/nprot.2014.099
apa: Studer, D., Zhao, S., Chai, X., Jonas, P. M., Graber, W., Nestel, S., &
Frotscher, M. (2014). Capture of activity-induced ultrastructural changes at synapses
by high-pressure freezing of brain tissue. Nature Protocols. Nature Publishing
Group. https://doi.org/10.1038/nprot.2014.099
chicago: Studer, Daniel, Shanting Zhao, Xuejun Chai, Peter M Jonas, Werner Graber,
Sigrun Nestel, and Michael Frotscher. “Capture of Activity-Induced Ultrastructural
Changes at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols.
Nature Publishing Group, 2014. https://doi.org/10.1038/nprot.2014.099.
ieee: D. Studer et al., “Capture of activity-induced ultrastructural changes
at synapses by high-pressure freezing of brain tissue,” Nature Protocols,
vol. 9, no. 6. Nature Publishing Group, pp. 1480–1495, 2014.
ista: Studer D, Zhao S, Chai X, Jonas PM, Graber W, Nestel S, Frotscher M. 2014.
Capture of activity-induced ultrastructural changes at synapses by high-pressure
freezing of brain tissue. Nature Protocols. 9(6), 1480–1495.
mla: Studer, Daniel, et al. “Capture of Activity-Induced Ultrastructural Changes
at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols,
vol. 9, no. 6, Nature Publishing Group, 2014, pp. 1480–95, doi:10.1038/nprot.2014.099.
short: D. Studer, S. Zhao, X. Chai, P.M. Jonas, W. Graber, S. Nestel, M. Frotscher,
Nature Protocols 9 (2014) 1480–1495.
date_created: 2018-12-11T11:56:09Z
date_published: 2014-05-29T00:00:00Z
date_updated: 2021-01-12T06:55:47Z
day: '29'
department:
- _id: PeJo
doi: 10.1038/nprot.2014.099
intvolume: ' 9'
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 1480 - 1495
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Nature Protocols
publication_status: published
publisher: Nature Publishing Group
publist_id: '4807'
quality_controlled: '1'
scopus_import: 1
status: public
title: Capture of activity-induced ultrastructural changes at synapses by high-pressure
freezing of brain tissue
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '2178'
abstract:
- lang: eng
text: We consider the three-state toric homogeneous Markov chain model (THMC) without
loops and initial parameters. At time T, the size of the design matrix is 6 ×
3 · 2T-1 and the convex hull of its columns is the model polytope. We study the
behavior of this polytope for T ≥ 3 and we show that it is defined by 24 facets
for all T ≥ 5. Moreover, we give a complete description of these facets. From
this, we deduce that the toric ideal associated with the design matrix is generated
by binomials of degree at most 6. Our proof is based on a result due to Sturmfels,
who gave a bound on the degree of the generators of a toric ideal, provided the
normality of the corresponding toric variety. In our setting, we established the
normality of the toric variety associated to the THMC model by studying the geometric
properties of the model polytope.
acknowledgement: Research of Martín del Campo supported in part by NSF Grant DMS-915211.
author:
- first_name: David
full_name: Haws, David
last_name: Haws
- first_name: Abraham
full_name: Martin Del Campo Sanchez, Abraham
id: 4CF47F6A-F248-11E8-B48F-1D18A9856A87
last_name: Martin Del Campo Sanchez
- first_name: Akimichi
full_name: Takemura, Akimichi
last_name: Takemura
- first_name: Ruriko
full_name: Yoshida, Ruriko
last_name: Yoshida
citation:
ama: Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. Markov degree of
the three-state toric homogeneous Markov chain model. Beitrage zur Algebra
und Geometrie. 2014;55(1):161-188. doi:10.1007/s13366-013-0178-y
apa: Haws, D., Martin del Campo Sanchez, A., Takemura, A., & Yoshida, R. (2014).
Markov degree of the three-state toric homogeneous Markov chain model. Beitrage
Zur Algebra Und Geometrie. Springer. https://doi.org/10.1007/s13366-013-0178-y
chicago: Haws, David, Abraham Martin del Campo Sanchez, Akimichi Takemura, and Ruriko
Yoshida. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.”
Beitrage Zur Algebra Und Geometrie. Springer, 2014. https://doi.org/10.1007/s13366-013-0178-y.
ieee: D. Haws, A. Martin del Campo Sanchez, A. Takemura, and R. Yoshida, “Markov
degree of the three-state toric homogeneous Markov chain model,” Beitrage zur
Algebra und Geometrie, vol. 55, no. 1. Springer, pp. 161–188, 2014.
ista: Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. 2014. Markov degree
of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra
und Geometrie. 55(1), 161–188.
mla: Haws, David, et al. “Markov Degree of the Three-State Toric Homogeneous Markov
Chain Model.” Beitrage Zur Algebra Und Geometrie, vol. 55, no. 1, Springer,
2014, pp. 161–88, doi:10.1007/s13366-013-0178-y.
short: D. Haws, A. Martin del Campo Sanchez, A. Takemura, R. Yoshida, Beitrage Zur
Algebra Und Geometrie 55 (2014) 161–188.
date_created: 2018-12-11T11:56:10Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '01'
department:
- _id: CaUh
doi: 10.1007/s13366-013-0178-y
intvolume: ' 55'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1204.3070
month: '03'
oa: 1
oa_version: Submitted Version
page: 161 - 188
publication: Beitrage zur Algebra und Geometrie
publication_status: published
publisher: Springer
publist_id: '4804'
quality_controlled: '1'
scopus_import: 1
status: public
title: Markov degree of the three-state toric homogeneous Markov chain model
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2014'
...
---
_id: '2177'
abstract:
- lang: eng
text: We give evidence for the difficulty of computing Betti numbers of simplicial
complexes over a finite field. We do this by reducing the rank computation for
sparse matrices with to non-zero entries to computing Betti numbers of simplicial
complexes consisting of at most a constant times to simplices. Together with the
known reduction in the other direction, this implies that the two problems have
the same computational complexity.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Salman
full_name: Parsa, Salman
id: 4BDBD4F2-F248-11E8-B48F-1D18A9856A87
last_name: Parsa
citation:
ama: 'Edelsbrunner H, Parsa S. On the computational complexity of betti numbers
reductions from matrix rank. In: Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms. SIAM; 2014:152-160. doi:10.1137/1.9781611973402.11'
apa: 'Edelsbrunner, H., & Parsa, S. (2014). On the computational complexity
of betti numbers reductions from matrix rank. In Proceedings of the Annual
ACM-SIAM Symposium on Discrete Algorithms (pp. 152–160). Portland, USA: SIAM.
https://doi.org/10.1137/1.9781611973402.11'
chicago: Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity
of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual
ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.
ieee: H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers
reductions from matrix rank,” in Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, Portland, USA, 2014, pp. 152–160.
ista: 'Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers
reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.'
mla: Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of
Betti Numbers Reductions from Matrix Rank.” Proceedings of the Annual ACM-SIAM
Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.
short: H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, SIAM, 2014, pp. 152–160.
conference:
end_date: 2014-01-07
location: Portland, USA
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2014-01-05
date_created: 2018-12-11T11:56:09Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973402.11
language:
- iso: eng
month: '01'
oa_version: None
page: 152 - 160
publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
publication_status: published
publisher: SIAM
publist_id: '4805'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the computational complexity of betti numbers reductions from matrix rank
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2185'
abstract:
- lang: eng
text: 'We revisit the classical problem of converting an imperfect source of randomness
into a usable cryptographic key. Assume that we have some cryptographic application
P that expects a uniformly random m-bit key R and ensures that the best attack
(in some complexity class) against P(R) has success probability at most δ. Our
goal is to design a key-derivation function (KDF) h that converts any random source
X of min-entropy k into a sufficiently "good" key h(X), guaranteeing
that P(h(X)) has comparable security δ′ which is ''close'' to δ. Seeded randomness
extractors provide a generic way to solve this problem for all applications P,
with resulting security δ′ = O(δ), provided that we start with entropy k ≥ m +
2 log (1/δ) - O(1). By a result of Radhakrishnan and Ta-Shma, this bound on k
(called the "RT-bound") is also known to be tight in general. Unfortunately,
in many situations the loss of 2 log (1/δ) bits of entropy is unacceptable. This
motivates the study KDFs with less entropy waste by placing some restrictions
on the source X or the application P. In this work we obtain the following new
positive and negative results in this regard: - Efficient samplability of the
source X does not help beat the RT-bound for general applications. This resolves
the SRT (samplable RT) conjecture of Dachman-Soled et al. [DGKM12] in the affirmative,
and also shows that the existence of computationally-secure extractors beating
the RT-bound implies the existence of one-way functions. - We continue in the
line of work initiated by Barak et al. [BDK+11] and construct new information-theoretic
KDFs which beat the RT-bound for large but restricted classes of applications.
Specifically, we design efficient KDFs that work for all unpredictability applications
P (e.g., signatures, MACs, one-way functions, etc.) and can either: (1) extract
all of the entropy k = m with a very modest security loss δ′ = O(δ·log (1/δ)),
or alternatively, (2) achieve essentially optimal security δ′ = O(δ) with a very
modest entropy loss k ≥ m + loglog (1/δ). In comparison, the best prior results
from [BDK+11] for this class of applications would only guarantee δ′ = O(√δ) when
k = m, and would need k ≥ m + log (1/δ) to get δ′ = O(δ). - The weaker bounds
of [BDK+11] hold for a larger class of so-called "square- friendly"
applications (which includes all unpredictability, but also some important indistinguishability,
applications). Unfortunately, we show that these weaker bounds are tight for the
larger class of applications. - We abstract out a clean, information-theoretic
notion of (k,δ,δ′)- unpredictability extractors, which guarantee "induced"
security δ′ for any δ-secure unpredictability application P, and characterize
the parameters achievable for such unpredictability extractors. Of independent
interest, we also relate this notion to the previously-known notion of (min-entropy)
condensers, and improve the state-of-the-art parameters for such condensers.'
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Dodis Y, Pietrzak KZ, Wichs D. Key derivation without entropy waste. In: Nguyen
P, Oswald E, eds. Vol 8441. Springer; 2014:93-110. doi:10.1007/978-3-642-55220-5_6'
apa: 'Dodis, Y., Pietrzak, K. Z., & Wichs, D. (2014). Key derivation without
entropy waste. In P. Nguyen & E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen,
Denmark: Springer. https://doi.org/10.1007/978-3-642-55220-5_6'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation
without Entropy Waste.” edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110.
Springer, 2014. https://doi.org/10.1007/978-3-642-55220-5_6.
ieee: 'Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,”
presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques,
Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110.'
ista: 'Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste.
EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441,
93–110.'
mla: Dodis, Yevgeniy, et al. Key Derivation without Entropy Waste. Edited
by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:10.1007/978-3-642-55220-5_6.
short: Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer,
2014, pp. 93–110.
conference:
end_date: 2014-05-15
location: Copenhagen, Denmark
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2014-05-11
date_created: 2018-12-11T11:56:12Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:55:51Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-55220-5_6
editor:
- first_name: Phong
full_name: Nguyen, Phong
last_name: Nguyen
- first_name: Elisabeth
full_name: Oswald, Elisabeth
last_name: Oswald
file:
- access_level: open_access
checksum: da1aa01221086083b23c92e547b48ff4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:43Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4705'
file_name: IST-2016-680-v1+1_708.pdf
file_size: 505389
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 8441'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 93 - 110
publication_status: published
publisher: Springer
publist_id: '4795'
pubrep_id: '680'
quality_controlled: '1'
scopus_import: 1
status: public
title: Key derivation without entropy waste
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8441
year: '2014'
...
---
_id: '2180'
abstract:
- lang: eng
text: Weighted majority votes allow one to combine the output of several classifiers
or voters. MinCq is a recent algorithm for optimizing the weight of each voter
based on the minimization of a theoretical bound over the risk of the vote with
elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated
good performance when combining weak classifiers, MinCq cannot make use of the
useful a priori knowledge that one may have when using a mixture of weak and strong
voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate
such knowledge in the form of a constraint over the distribution of the weights,
along with general proofs of convergence that stand in the sample compression
setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers
with a specific modeling of the voters' performance. P-MinCq significantly outperforms
the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We
show that it is also competitive with LMNN, a popular metric learning algorithm,
and that combining both approaches further reduces the error.
acknowledgement: 'This work was funded by the French project SoLSTiCe ANR-13-BS02-01
of the ANR. '
author:
- first_name: Aurélien
full_name: Bellet, Aurélien
last_name: Bellet
- first_name: Amaury
full_name: Habrard, Amaury
last_name: Habrard
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
- first_name: Marc
full_name: Sebban, Marc
last_name: Sebban
citation:
ama: Bellet A, Habrard A, Morvant E, Sebban M. Learning a priori constrained weighted
majority votes. Machine Learning. 2014;97(1-2):129-154. doi:10.1007/s10994-014-5462-z
apa: Bellet, A., Habrard, A., Morvant, E., & Sebban, M. (2014). Learning a priori
constrained weighted majority votes. Machine Learning. Springer. https://doi.org/10.1007/s10994-014-5462-z
chicago: Bellet, Aurélien, Amaury Habrard, Emilie Morvant, and Marc Sebban. “Learning
a Priori Constrained Weighted Majority Votes.” Machine Learning. Springer,
2014. https://doi.org/10.1007/s10994-014-5462-z.
ieee: A. Bellet, A. Habrard, E. Morvant, and M. Sebban, “Learning a priori constrained
weighted majority votes,” Machine Learning, vol. 97, no. 1–2. Springer,
pp. 129–154, 2014.
ista: Bellet A, Habrard A, Morvant E, Sebban M. 2014. Learning a priori constrained
weighted majority votes. Machine Learning. 97(1–2), 129–154.
mla: Bellet, Aurélien, et al. “Learning a Priori Constrained Weighted Majority Votes.”
Machine Learning, vol. 97, no. 1–2, Springer, 2014, pp. 129–54, doi:10.1007/s10994-014-5462-z.
short: A. Bellet, A. Habrard, E. Morvant, M. Sebban, Machine Learning 97 (2014)
129–154.
date_created: 2018-12-11T11:56:10Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2021-01-12T06:55:49Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/s10994-014-5462-z
ec_funded: 1
intvolume: ' 97'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01009578/document
month: '10'
oa: 1
oa_version: Submitted Version
page: 129 - 154
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Machine Learning
publication_status: published
publisher: Springer
publist_id: '4802'
quality_controlled: '1'
scopus_import: 1
status: public
title: Learning a priori constrained weighted majority votes
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2014'
...