---
_id: '281'
abstract:
- lang: eng
text: 'Although cells respond specifically to environments, how environmental identity
is encoded intracellularly is not understood. Here, we study this organization
of information in budding yeast by estimating the mutual information between environmental
transitions and the dynamics of nuclear translocation for 10 transcription factors.
Our method of estimation is general, scalable, and based on decoding from single
cells. The dynamics of the transcription factors are necessary to encode the highest
amounts of extracellular information, and we show that information is transduced
through two channels: Generalists (Msn2/4, Tod6 and Dot6, Maf1, and Sfp1) can
encode the nature of multiple stresses, but only if stress is high; specialists
(Hog1, Yap1, and Mig1/2) encode one particular stress, but do so more quickly
and for a wider range of magnitudes. In particular, Dot6 encodes almost as much
information as Msn2, the master regulator of the environmental stress response.
Each transcription factor reports differently, and it is only their collective
behavior that distinguishes between multiple environmental states. Changes in
the dynamics of the localization of transcription factors thus constitute a precise,
distributed internal representation of extracellular change. We predict that such
multidimensional representations are common in cellular decision-making.'
acknowledgement: This work was supported by the Biotechnology and Biological Sciences
Research Council (J.M.J.P., I.F., and P.S.S.), the Engineering and Physical Sciences
Research Council (EPSRC) (A.A.G.), and Austrian Science Fund Grant FWF P28844 (to
G.T.).
article_processing_charge: No
article_type: original
author:
- first_name: Alejandro
full_name: Granados, Alejandro
last_name: Granados
- first_name: Julian
full_name: Pietsch, Julian
last_name: Pietsch
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
- first_name: Isebail
full_name: Farquhar, Isebail
last_name: Farquhar
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Peter
full_name: Swain, Peter
last_name: Swain
citation:
ama: Granados A, Pietsch J, Cepeda Humerez SA, Farquhar I, Tkačik G, Swain P. Distributed
and dynamic intracellular organization of extracellular information. PNAS.
2018;115(23):6088-6093. doi:10.1073/pnas.1716659115
apa: Granados, A., Pietsch, J., Cepeda Humerez, S. A., Farquhar, I., Tkačik, G.,
& Swain, P. (2018). Distributed and dynamic intracellular organization of
extracellular information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1716659115
chicago: Granados, Alejandro, Julian Pietsch, Sarah A Cepeda Humerez, Isebail Farquhar,
Gašper Tkačik, and Peter Swain. “Distributed and Dynamic Intracellular Organization
of Extracellular Information.” PNAS. National Academy of Sciences, 2018.
https://doi.org/10.1073/pnas.1716659115.
ieee: A. Granados, J. Pietsch, S. A. Cepeda Humerez, I. Farquhar, G. Tkačik, and
P. Swain, “Distributed and dynamic intracellular organization of extracellular
information,” PNAS, vol. 115, no. 23. National Academy of Sciences, pp.
6088–6093, 2018.
ista: Granados A, Pietsch J, Cepeda Humerez SA, Farquhar I, Tkačik G, Swain P. 2018.
Distributed and dynamic intracellular organization of extracellular information.
PNAS. 115(23), 6088–6093.
mla: Granados, Alejandro, et al. “Distributed and Dynamic Intracellular Organization
of Extracellular Information.” PNAS, vol. 115, no. 23, National Academy
of Sciences, 2018, pp. 6088–93, doi:10.1073/pnas.1716659115.
short: A. Granados, J. Pietsch, S.A. Cepeda Humerez, I. Farquhar, G. Tkačik, P.
Swain, PNAS 115 (2018) 6088–6093.
date_created: 2018-12-11T11:45:35Z
date_published: 2018-06-05T00:00:00Z
date_updated: 2023-09-11T12:58:24Z
day: '05'
department:
- _id: GaTk
doi: 10.1073/pnas.1716659115
external_id:
isi:
- '000434114900071'
pmid:
- '29784812'
intvolume: ' 115'
isi: 1
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/early/2017/09/21/192039
month: '06'
oa: 1
oa_version: Preprint
page: 6088 - 6093
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7618'
quality_controlled: '1'
related_material:
record:
- id: '6473'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Distributed and dynamic intracellular organization of extracellular information
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '620'
abstract:
- lang: eng
text: Clathrin-mediated endocytosis requires the coordinated assembly of various
endocytic proteins and lipids at the plasma membrane. Accumulating evidence demonstrates
a crucial role for phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) in endocytosis,
but specific roles for PtdIns(4)P other than as the biosynthetic precursor of
PtdIns(4,5)P2 have not been clarified. In this study we investigated the role
of PtdIns(4)P or PtdIns(4,5)P2 in receptor-mediated endocytosis through the construction
of temperature-sensitive (ts) mutants for the PI 4-kinases Stt4p and Pik1p and
the PtdIns(4) 5-kinase Mss4p. Quantitative analyses of endocytosis revealed that
both the stt4(ts)pik1(ts) and mss4(ts) mutants have a severe defect in endocytic
internalization. Live-cell imaging of endocytic protein dynamics in stt4(ts)pik1(ts)
and mss4(ts) mutants revealed that PtdIns(4)P is required for the recruitment
of the alpha-factor receptor Ste2p to clathrin-coated pits whereas PtdIns(4,5)P2
is required for membrane internalization. We also found that the localization
to endocytic sites of the ENTH/ANTH domain-bearing clathrin adaptors, Ent1p/Ent2p
and Yap1801p/Yap1802p, is significantly impaired in the stt4(ts)pik1(ts) mutant,
but not in the mss4(ts) mutant. These results suggest distinct roles in successive
steps for PtdIns(4)P and PtdIns(4,5)P2 during receptor-mediated endocytosis.
article_number: jcs207696
article_processing_charge: No
author:
- first_name: Wataru
full_name: Yamamoto, Wataru
last_name: Yamamoto
- first_name: Suguru
full_name: Wada, Suguru
last_name: Wada
- first_name: Makoto
full_name: Nagano, Makoto
last_name: Nagano
- first_name: Kaito
full_name: Aoshima, Kaito
last_name: Aoshima
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Junko
full_name: Toshima, Junko
last_name: Toshima
- first_name: Jiro
full_name: Toshima, Jiro
last_name: Toshima
citation:
ama: Yamamoto W, Wada S, Nagano M, et al. Distinct roles for plasma membrane PtdIns
4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis. Journal of
Cell Science. 2018;131(1). doi:10.1242/jcs.207696
apa: Yamamoto, W., Wada, S., Nagano, M., Aoshima, K., Siekhaus, D. E., Toshima,
J., & Toshima, J. (2018). Distinct roles for plasma membrane PtdIns 4 P and
PtdIns 4 5 P2 during yeast receptor mediated endocytosis. Journal of Cell Science.
Company of Biologists. https://doi.org/10.1242/jcs.207696
chicago: Yamamoto, Wataru, Suguru Wada, Makoto Nagano, Kaito Aoshima, Daria E Siekhaus,
Junko Toshima, and Jiro Toshima. “Distinct Roles for Plasma Membrane PtdIns 4
P and PtdIns 4 5 P2 during Yeast Receptor Mediated Endocytosis.” Journal of
Cell Science. Company of Biologists, 2018. https://doi.org/10.1242/jcs.207696.
ieee: W. Yamamoto et al., “Distinct roles for plasma membrane PtdIns 4 P
and PtdIns 4 5 P2 during yeast receptor mediated endocytosis,” Journal of Cell
Science, vol. 131, no. 1. Company of Biologists, 2018.
ista: Yamamoto W, Wada S, Nagano M, Aoshima K, Siekhaus DE, Toshima J, Toshima J.
2018. Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast
receptor mediated endocytosis. Journal of Cell Science. 131(1), jcs207696.
mla: Yamamoto, Wataru, et al. “Distinct Roles for Plasma Membrane PtdIns 4 P and
PtdIns 4 5 P2 during Yeast Receptor Mediated Endocytosis.” Journal of Cell
Science, vol. 131, no. 1, jcs207696, Company of Biologists, 2018, doi:10.1242/jcs.207696.
short: W. Yamamoto, S. Wada, M. Nagano, K. Aoshima, D.E. Siekhaus, J. Toshima, J.
Toshima, Journal of Cell Science 131 (2018).
date_created: 2018-12-11T11:47:32Z
date_published: 2018-01-04T00:00:00Z
date_updated: 2023-09-11T12:57:13Z
day: '04'
department:
- _id: DaSi
doi: 10.1242/jcs.207696
external_id:
isi:
- '000424786900012'
pmid:
- '29192062'
intvolume: ' 131'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/29192062
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Cell Science
publication_status: published
publisher: Company of Biologists
publist_id: '7184'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast
receptor mediated endocytosis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 131
year: '2018'
...
---
_id: '182'
abstract:
- lang: eng
text: We describe a new algorithm for the parametric identification problem for
signal temporal logic (STL), stated as follows. Given a densetime real-valued
signal w and a parameterized temporal logic formula φ, compute the subset of the
parameter space that renders the formula satisfied by the signal. Unlike previous
solutions, which were based on search in the parameter space or quantifier elimination,
our procedure works recursively on φ and computes the evolution over time of the
set of valid parameter assignments. This procedure is similar to that of monitoring
or computing the robustness of φ relative to w. Our implementation and experiments
demonstrate that this approach can work well in practice.
alternative_title:
- HSCC Proceedings
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
citation:
ama: 'Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL.
In: Proceedings of the 21st International Conference on Hybrid Systems.
ACM; 2018:177-186. doi:10.1145/3178126.3178132'
apa: 'Bakhirkin, A., Ferrere, T., & Maler, O. (2018). Efficient parametric identification
for STL. In Proceedings of the 21st International Conference on Hybrid Systems
(pp. 177–186). Porto, Portugal: ACM. https://doi.org/10.1145/3178126.3178132'
chicago: Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric
Identification for STL.” In Proceedings of the 21st International Conference
on Hybrid Systems, 177–86. ACM, 2018. https://doi.org/10.1145/3178126.3178132.
ieee: A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification
for STL,” in Proceedings of the 21st International Conference on Hybrid Systems,
Porto, Portugal, 2018, pp. 177–186.
ista: 'Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification
for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC:
Hybrid Systems: Computation and Control, HSCC Proceedings, , 177–186.'
mla: Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” Proceedings
of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–86,
doi:10.1145/3178126.3178132.
short: A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International
Conference on Hybrid Systems, ACM, 2018, pp. 177–186.
conference:
end_date: 2018-04-13
location: Porto, Portugal
name: 'HSCC: Hybrid Systems: Computation and Control'
start_date: 2018-04-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-04-11T00:00:00Z
date_updated: 2023-09-11T13:30:51Z
day: '11'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3178126.3178132
external_id:
isi:
- '000474781600020'
file:
- access_level: open_access
checksum: 81eabc96430e84336ea88310ac0a1ad0
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:18:29Z
date_updated: 2020-07-14T12:45:17Z
file_id: '7833'
file_name: 2018_HSCC_Bakhirkin.pdf
file_size: 5900421
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 177 - 186
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 21st International Conference on Hybrid Systems
publication_identifier:
isbn:
- '978-1-4503-5642-8 '
publication_status: published
publisher: ACM
publist_id: '7739'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient parametric identification for STL
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '143'
abstract:
- lang: eng
text: 'Vector Addition Systems with States (VASS) provide a well-known and fundamental
model for the analysis of concurrent processes, parameterized systems, and are
also used as abstract models of programs in resource bound analysis. In this paper
we study the problem of obtaining asymptotic bounds on the termination time of
a given VASS. In particular, we focus on the practically important case of obtaining
polynomial bounds on termination time. Our main contributions are as follows:
First, we present a polynomial-time algorithm for deciding whether a given VASS
has a linear asymptotic complexity. We also show that if the complexity of a VASS
is not linear, it is at least quadratic. Second, we classify VASS according to
quantitative properties of their cycles. We show that certain singularities in
these properties are the key reason for non-polynomial asymptotic complexity of
VASS. In absence of singularities, we show that the asymptotic complexity is always
polynomial and of the form Θ(nk), for some integer k d, where d is the dimension
of the VASS. We present a polynomial-time algorithm computing the optimal k. For
general VASS, the same algorithm, which is based on a complete technique for the
construction of ranking functions in VASS, produces a valid lower bound, i.e.,
a k such that the termination complexity is (nk). Our results are based on new
insights into the geometry of VASS dynamics, which hold the potential for further
applicability to VASS analysis.'
alternative_title:
- ACM/IEEE Symposium on Logic in Computer Science
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Dominik
full_name: Velan, Dominik
last_name: Velan
- first_name: Florian
full_name: Zuleger, Florian
last_name: Zuleger
citation:
ama: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient
algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033.
IEEE; 2018:185-194. doi:10.1145/3209108.3209191'
apa: 'Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., & Zuleger,
F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS
(Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science,
Oxford, United Kingdom: IEEE. https://doi.org/10.1145/3209108.3209191'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik
Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination
Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
ieee: 'T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger,
“Efficient algorithms for asymptotic bounds on termination time in VASS,” presented
at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033,
pp. 185–194.'
ista: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient
algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer
Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.'
mla: Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination
Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
short: T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:,
IEEE, 2018, pp. 185–194.
conference:
end_date: 2018-07-12
location: Oxford, United Kingdom
name: 'LICS: Logic in Computer Science'
start_date: 2018-07-09
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-09T00:00:00Z
date_updated: 2023-09-11T13:23:42Z
day: '09'
department:
- _id: KrCh
doi: 10.1145/3209108.3209191
ec_funded: 1
external_id:
isi:
- '000545262800020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10985
month: '07'
oa: 1
oa_version: Preprint
page: 185 - 194
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
isbn:
- 978-1-4503-5583-4
publication_status: published
publisher: IEEE
publist_id: '7780'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient algorithms for asymptotic bounds on termination time in VASS
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: F138033
year: '2018'
...
---
_id: '273'
abstract:
- lang: eng
text: The accuracy of information retrieval systems is often measured using complex
loss functions such as the average precision (AP) or the normalized discounted
cumulative gain (NDCG). Given a set of positive and negative samples, the parameters
of a retrieval system can be estimated by minimizing these loss functions. However,
the non-differentiability and non-decomposability of these loss functions does
not allow for simple gradient based optimization algorithms. This issue is generally
circumvented by either optimizing a structured hinge-loss upper bound to the loss
function or by using asymptotic methods like the direct-loss minimization framework.
Yet, the high computational complexity of loss-augmented inference, which is necessary
for both the frameworks, prohibits its use in large training data sets. To alleviate
this deficiency, we present a novel quicksort flavored algorithm for a large class
of non-decomposable loss functions. We provide a complete characterization of
the loss functions that are amenable to our algorithm, and show that it includes
both AP and NDCG based loss functions. Furthermore, we prove that no comparison
based algorithm can improve upon the computational complexity of our approach
asymptotically. We demonstrate the effectiveness of our approach in the context
of optimizing the structured hinge loss upper bound of AP and NDCG loss for learning
models for a variety of vision tasks. We show that our approach provides significantly
better results than simpler decomposable loss functions, while requiring a comparable
training time.
article_processing_charge: No
author:
- first_name: Pritish
full_name: Mohapatra, Pritish
last_name: Mohapatra
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
- first_name: C V
full_name: Jawahar, C V
last_name: Jawahar
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: M Pawan
full_name: Kumar, M Pawan
last_name: Kumar
citation:
ama: 'Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization
for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389'
apa: 'Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., & Kumar, M.
P. (2018). Efficient optimization for rank-based loss functions. In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition (pp. 3693–3701). Salt
Lake City, UT, USA: IEEE. https://doi.org/10.1109/cvpr.2018.00389'
chicago: Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and
M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018
IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701.
IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.
ieee: P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient
optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on
Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp.
3693–3701.
ista: 'Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient
optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern
Recognition, 3693–3701.'
mla: Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
short: P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018
IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp.
3693–3701.
conference:
end_date: 2018-06-22
location: Salt Lake City, UT, USA
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
date_created: 2018-12-11T11:45:33Z
date_published: 2018-06-28T00:00:00Z
date_updated: 2023-09-11T13:24:43Z
day: '28'
department:
- _id: VlKo
doi: 10.1109/cvpr.2018.00389
ec_funded: 1
external_id:
arxiv:
- '1604.08269'
isi:
- '000457843603087'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08269
month: '06'
oa: 1
oa_version: Preprint
page: 3693-3701
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient optimization for rank-based loss functions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...