Explore the words cloud of the SpeedInfTradeoff project. It provides you a very rough idea of what is the project "SpeedInfTradeoff" about.
The following table provides information about the project.
TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY
|Coordinator Country||Israel [IL]|
|Total cost||1˙515˙801 €|
|EC max contribution||1˙515˙801 € (100%)|
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
|Duration (year-month-day)||from 2016-06-01 to 2021-05-31|
Take a look of project's partnership.
|1||TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY||IL (HAIFA)||coordinator||1˙515˙801.00|
The starting point of this research proposal is a recent result by the PI, making progress in a half century old, notoriously open problem. In the mid 1960’s, Tukey and Cooley discovered the Fast Fourier Transform, an algorithm for performing one of the most important linear transformations in science and engineering, the (discrete) Fourier transform, in time complexity O(n log n). In spite of its importance, a super-linear lower bound has been elusive for many years, with only very limited results. Very recently the PI managed to show that, roughly speaking, a faster Fourier transform must result in information loss, in the form of numerical accuracy. The result can be seen as a type of computational uncertainty principle, whereby faster computation increases uncertainty in data. The mathematical argument is established by defining a type of matrix quasi-entropy, generalizing Shannon’s measure of information (entropy) to “quasi-probabilities” (which can be negative, more than 1, or even complex). This result, which is not believed to be tight, does not close the book on Fourier complexity. More importantly, the vision proposed by the PI here reaches far beyond Fourier computation. The computation-information tradeoff underlying the result suggests a novel view of complexity theory as a whole. We can now revisit some classic complexity theoretical problems with a fresh view. Examples of these problems include better understanding of the complexity of polynomial multiplication, integer multiplication, auto-correlation and cross-correlation computation, dimensionality reduction via the Fast Johnson-Linednstrauss Transform (FJLT; also discovered and developed by the PI), large scale linear algebra (linear regression, Principal Component Analysis - PCA, compressed sensing, matrix multiplication) as well as binary functions such as integer multiplication.
|year||authors and title||journal||last update|
Ivo F. D. Oliveira, Nir Ailon, Ori Davidov
A New and Flexible Approach to the Analysis of Paired Comparison Data
published pages: 1=20, ISSN: 1533-7928, DOI:
|JMLR Volume 19, Number 60||2019-08-05|
Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation
published pages: , ISSN: 0304-3975, DOI:
|Theoretical Computer Science||2019-08-05|
Elad Hoffer, Itay Hubara, Daniel Soudry
Fix your classifier: the marginal value of training the last weight layer
published pages: , ISSN: , DOI:
|International Conference on Learning Representations (ICLR) 2019 This is an annual conference.||2019-05-22|
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "SPEEDINFTRADEOFF" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (email@example.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "SPEEDINFTRADEOFF" are provided by the European Opendata Portal: CORDIS opendata.
The Enemy of the Good: Towards a Theory of Moral ProgressRead More
Discovery and Characterization of Hydrogen-Based High-Temperature SuperconductorsRead More
Towards Realistic Modelling of Nucleosome Organization Inside Functional Chromatin DomainsRead More