Filters








12 Hits in 5.9 sec

Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time [article]

Matti Karppa and Petteri Kaski and Jukka Kohonen and Padraig Ó Catháin
2016 arXiv   pre-print
ACM 62 (2015) Art. 13] subquadratic-time algorithm for finding outlier correlations in binary data.  ...  Our main technical tool for derandomization is an explicit family of correlation amplifiers built via a family of zigzag-product expanders in Reingold, Vadhan, and Wigderson [Ann. of Math. 155 (2002) 157  ...  The main result of this paper is that sufficiently powerful explicit amplifiers exist to find outlier correlations in deterministic subquadratic time. Theorem 3 (Explicit amplifier family).  ... 
arXiv:1606.05608v2 fatcat:zljip3bqrjdorkncbz6ibfagd4

Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time

Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin
2020 Algorithmica  
We derandomize Valiant's (J ACM 62, Article 13, 2015) subquadratic-time algorithm for finding outlier correlations in binary data.  ...  Our main technical tool for derandomization is an explicit family of correlation amplifiers built via a family of zigzag-product expanders by Reingold et al. (Ann Math 155(1):157-187, 2002).  ...  Our Results The main result of this paper is that sufficiently powerful explicit amplifiers exist to find outlier correlations in deterministic subquadratic time.  ... 
doi:10.1007/s00453-020-00727-1 pmid:33088007 pmcid:PMC7568719 fatcat:32e6fpibi5ellon6ueosiqup6y

Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time

Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Ó Catháin, Marc Herbstritt
2016 European Symposium on Algorithms  
ACM 62 (2015) Art. 13] subquadratic-time algorithm for finding outlier correlations in binary data.  ...  Our main technical tool for derandomization is an explicit family of correlation amplifiers built via a family of zigzagproduct expanders in Reingold, Vadhan, and Wigderson [Ann. of Math. 155 (2002) 157  ...  The main result of this paper is that sufficiently powerful explicit amplifiers exist to find outlier correlations in deterministic subquadratic time. Theorem 3 (Explicit amplifier family).  ... 
doi:10.4230/lipics.esa.2016.52 dblp:conf/esa/KarppaKKC16 fatcat:aeu2t4zknzgghhg6g7vuplxlce

Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers

Piotr Sankowski, Christos Zaroliagis, Marc Herbstritt
2016 European Symposium on Algorithms  
An ILP-based Proof System for the Crossing Number Problem Markus Chimani and Tilo Wiedera .  ...  Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time Matti Karppa, Petteri Kaski, Jukka Kohonen, and Padraig Ó Catháin . . . . . . . . . . . .52:1-52:17 The Computational  ...  In response to the call for papers, ESA 2016 attracted a rather high number of 282 submissions, 230 for Track A and 52 for Track B.  ... 
doi:10.4230/lipics.esa.2016.0 dblp:conf/esa/X16 fatcat:gsnlpy3zhzeqvoe3ru2hxylgxm

Editors: Piotr Sankowski and Christos Zaroliagis; Article No. 52

Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Catháin, Matti Karppa, Petteri Kaski, Jukka Kohonen, Padraig Catháin
licensed under Creative Commons License CC-BY 24th Annual European Symposium on Algorithms (ESA 2016)   unpublished
ACM 62 (2015) Art. 13] subquadratic-time algorithm for finding outlier correlations in binary data.  ...  Our main technical tool for derandomization is an explicit family of correlation amplifiers built via a family of zigzag-product expanders in Reingold, Vadhan, and Wigderson [Ann. of Math. 155 (2002) 157  ...  we obtain a deterministic algorithm for finding outlier correlations in subquadratic time using bucketing and fast matrix multiplication.  ... 
fatcat:tyqbd2hmx5b3bkp2epb32rxidq

Distributed Newton-like Algorithms and Learning for Optimized Power Dispatch [article]

Tor Anderson
2021 arXiv   pre-print
A distinctly motivating application for this thesis is real-time power dispatch of distributed energy resources for providing frequency control in a distribution grid or microgrid with high renewable energy  ...  This thesis explores a particular class of distributed optimization methods for various separable resource allocation problems, which are of high interest in a wide array of multi-agent settings.  ...  Acknowledgements The material in this chapter, in full, is being revised and prepared for submission to the Cristian Cortes-Aguirre for supplying the BESS.  ... 
arXiv:2103.13493v1 fatcat:uytczmdftndkdhy5spo6uej7le

LIPIcs, Volume 98, ICDT'18, Complete Volume [article]

Benny Kimelfeld, Yael Amsterdamer
2018
We observe that P is set-parallel-correct for Q. Indeed, there are only two minimal valuations for Q over U : V a = {x → a, y → a} and V b = {x → b, y → b}.  ...  Acknowledgements We acknowledge Chandra Chekuri for his helpful comments at https:// cstheory.stackexchange.com/a/38943/, as well as Florent Capelli for pointing out the connection to [19, Corollary 6.35  ...  Concluding Remarks We have shown how to guarantee accurate recovery of correlation outliers using a sketch-based method, beating LSH on query time for small correlation outliers and vanishing correlation  ... 
doi:10.4230/lipics.icdt.2018 fatcat:iaf5nc6cunacfluh2qhhot55ry

OASIcs, Volume 69, SOSA'19, Complete Volume [article]

Jeremy T. Fineman, Michael Mitzenmacher
2019
The work of David Wajc is supported in part by NSF grants CCF-1618280, CCF-1814603, CCF-1527110 and NSF CAREER award CCF-1750808.  ...  Finding the Median. J. Comput. Syst. Sci., 13(2):184-199, 1976. doi:10.1016/S0022-0000(76)80029-3. William L. Steiger and Ileana Streinu. A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines.  ...  Finding General Correlations Past work on the Light Bulb Problem has also approached a more general problem of finding correlations: Problem 7 (Finding Correlations).  ... 
doi:10.4230/oasics.sosa.2019 fatcat:qjz3tl5ccfe3nprcrv6msbfwbq

Text mining and applications in life sciences [article]

Alexander Hinneburg, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität, Brass, Stefan, Prof. Dr., Seidl, Thomas, Prof. Dr., Spiliopoulou, Myra, Prof. Dr.
2018
In dieser Arbeit wird untersucht, ob und wie statistische Methoden zur Textanalyse auf Anwendungen aus den Lebenswissenschaften übertragen werden können.  ...  All diese verschiedenen Datensorten können sinnvoll in eine Repräsentation überführt werden, die analog der Bag-of-Words-Repräsentation von Textdokumenten ist.  ...  Most parts are published as peer reviewed papers in journals or conferences proceedings that result from collaborations with students in their diploma theses supervised by the author or/and with collaborators  ... 
doi:10.25673/679 fatcat:lzb5y5qps5amjeqrrr55gnbcry

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111) Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) Computational Models of Cultural Behavior for Human-Agent Interaction (Dagstuhl Seminar 14131) Interaction and Collective Movement Processing (Dagstuhl Seminar 14132) Spatial reference in the Semantic Web and in Robotics (Dagstuhl Seminar 14142)

Johannes Fürnkranz, Eyke Hüllermeier, Cynthia Rudin, Scott Sanner, Roman Słowiński, Maxime Crochemore, James Currie, Gregory Kucherov, Dirk Nowotka, Pierre Dillenbourg, Claude Kirchner, John Mitchell (+25 others)
2014 unpublished
The motivation for this seminar was to showcase recent progress in these different areas with the goal of working towards a common basis of understanding, which should help to facilitate future synergies  ...  Preferences have recently received considerable attention in disciplines such as machine learning, knowledge discovery, information retrieval, statistics, social choice theory, multiple criteria decision  ...  This yields both an implicit characterization of polynomial time in terms of ordinary differential equations, and a completeness result on the reachability problems for the corresponding class.  ... 
fatcat:k3cugkqpf5btlba2hklfxyujdq

Self Exploration of Sensorimotor Spaces in Robots. Self-Exploration of Sensorimotor Spaces in Robots Mathématiques et Informatique Spécialité Informatique L'auto-exploration des espaces sensorimoteurs chez les robots Mathématiques et Informatique Spécialité Informatique

Fabien Benureau, Fabien Benureau, Verena Hafner, Jean-Baptiste Mouret, Manuel Lopes, Fabien Benureau, Verena Hafner, Jean-Baptiste Mouret
unpublished
suited for integration in self-sufficient platforms.  ...  algorithms, sensorimotor exploration is still an expensive propositiona problem since robots inherently face constraints on the amount of data they are able to gather; each observation takes a non-negligible time  ...  , deterministic environments.  ... 
fatcat:sucupzioobbkhoibgg3bj3txuq

Computational and Statistical Advances in Testing and Learning

Aaditya Kumar Ramdas
2018
We also develop a unified proof for convergence rates of randomized algorithms for the ordinary least squares and ridge regression problems in a variety of settings, with the purpose of investigating which  ...  We provide geometrical and convex analytical insights into the role of the margin in margin-based classification, and develop new greedy primal-dual algorithms for non-linear classification.  ...  Acknowledgments Acknowledgements We thank Rui Castro for detailed conversations about our model and results. This work is supported in part by NSF Big Data grant IIS-1247658. Acknowledgments  ... 
doi:10.1184/r1/6715238 fatcat:6asjrtoczbeqxp3ydooy5aywlu