default search action
Naftali Tishby
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i33]Stas Tiomkin, Ilya Nemenman, Daniel Polani, Naftali Tishby:
Intrinsic Motivation in Dynamical Control Systems. CoRR abs/2301.00005 (2023) - 2022
- [j41]Nadav Amir, Naftali Tishby, Israel Nelken:
A simple model of the attentional blink and its modulation by mental training. PLoS Comput. Biol. 18(8) (2022) - 2021
- [c93]Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby:
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. ISIT 2021: 2625-2630 - [i32]Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby:
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. CoRR abs/2103.02646 (2021) - [i31]Hagai Rappeport, Irit Levin Reisman, Naftali Tishby, Nathalie Q. Balaban:
Detecting chaos in lineage-trees: A deep learning approach. CoRR abs/2106.08956 (2021) - 2020
- [j40]Amichai Painsky, Meir Feder, Naftali Tishby:
Nonlinear Canonical Correlation Analysis: A Compressed Representation Approach. Entropy 22(2): 208 (2020) - [j39]Hadar Levi-Aharoni, Oren Shriki, Naftali Tishby:
Surprise response as a probe for compressed memory states. PLoS Comput. Biol. 16(2) (2020) - [j38]Nadav Amir, Reut Suliman-Lavie, Maayan Tal, Sagiv Shifman, Naftali Tishby, Israel Nelken:
Value-complexity tradeoff explains mouse navigational learning. PLoS Comput. Biol. 16(12) (2020) - [c92]Ron M. Hecht, Ariel Telpaz, Gila Kamhi, Omer Tsimhoni, Aharon Bar-Hillel, Naftali Tishby:
Modeling the Effect of Driver's Eye Gaze Pattern Under Workload: Gaussian Mixture Approach. CogSci 2020 - [i30]Zoe Piran, Ravid Shwartz-Ziv, Naftali Tishby:
The Dual Information Bottleneck. CoRR abs/2006.04641 (2020)
2010 – 2019
- 2019
- [j37]Ron M. Hecht, Aharon Bar-Hillel, Ariel Telpaz, Omer Tsimhoni, Naftali Tishby:
Information Constrained Control Analysis of Eye Gaze Distribution Under Workload. IEEE Trans. Hum. Mach. Syst. 49(6): 474-484 (2019) - [j36]Noga Zaslavsky, Charles Kemp, Naftali Tishby, Terry Regier:
Color Naming Reflects Both Perceptual Structure and Communicative Need. Top. Cogn. Sci. 11(1): 207-219 (2019) - [c91]Noga Zaslavsky, Karee Garvin, Charles Kemp, Naftali Tishby, Terry Regier:
Evolution and efficiency in color naming: The case of Nafaanra. CogSci 2019: 68 - [c90]Noga Zaslavsky, Terry Regier, Naftali Tishby, Charles Kemp:
Semantic categories of artifacts and animals reflect efficient coding. CogSci 2019: 1254-1260 - [c89]Noga Zaslavsky, Charles Kemp, Naftali Tishby, Terry Regier:
Communicative need and color naming. CogSci 2019: 3613 - [c88]Ron M. Hecht, Ariel Telpaz, Gila Kamhi, Aharon Bar-Hillel, Naftali Tishby:
Information Constrained Control for Visual Detection of Important Areas. ICASSP 2019: 4080-4084 - [i29]Noga Zaslavsky, Terry Regier, Naftali Tishby, Charles Kemp:
Semantic categories of artifacts and animals reflect efficient coding. CoRR abs/1905.04562 (2019) - 2018
- [j35]Noga Zaslavsky, Charles Kemp, Terry Regier, Naftali Tishby:
Efficient compression in color naming and its evolution. Proc. Natl. Acad. Sci. USA 115(31): 7937-7942 (2018) - [c87]Noga Zaslavsky, Charles Kemp, Terry Regier, Naftali Tishby:
Information-theoretic efficiency and semantic variation: The case of color naming. CogSci 2018 - [c86]Noga Zaslavsky, Charles Kemp, Naftali Tishby, Terry Regier:
Color naming reflects both perceptual structure and communicative need. CogSci 2018 - [i28]Noga Zaslavsky, Charles Kemp, Naftali Tishby, Terry Regier:
Color naming reflects both perceptual structure and communicative need. CoRR abs/1805.06165 (2018) - [i27]Noga Zaslavsky, Charles Kemp, Terry Regier, Naftali Tishby:
Efficient human-like semantic representations via the Information Bottleneck principle. CoRR abs/1808.03353 (2018) - [i26]Amichai Painsky, Meir Feder, Naftali Tishby:
An Information-Theoretic Framework for Non-linear Canonical Correlation Analysis. CoRR abs/1810.13259 (2018) - 2017
- [j34]Amichai Painsky, Naftali Tishby:
Gaussian Lower Bound for the Information Bottleneck Limit. J. Mach. Learn. Res. 18: 213:1-213:29 (2017) - [j33]Siwei Wang, Alexander Borst, Noga Zaslavsky, Naftali Tishby, Idan Segev:
Efficient encoding of motion is mediated by gap junctions in the fly visual system. PLoS Comput. Biol. 13(12) (2017) - [i25]Stas Tiomkin, Daniel Polani, Naftali Tishby:
Control Capacity of Partially Observable Dynamic Systems in Continuous Time. CoRR abs/1701.04984 (2017) - [i24]Michal Moshkovitz, Naftali Tishby:
Mixing Complexity and its Applications to Neural Networks. CoRR abs/1703.00729 (2017) - [i23]Ravid Shwartz-Ziv, Naftali Tishby:
Opening the Black Box of Deep Neural Networks via Information. CoRR abs/1703.00810 (2017) - [i22]Stas Tiomkin, Naftali Tishby:
A Unified Bellman Equation for Causal Information and Value in Markov Decision Processes. CoRR abs/1703.01585 (2017) - [i21]Amichai Painsky, Naftali Tishby:
Gaussian Lower Bound for the Information Bottleneck Limit. CoRR abs/1711.02421 (2017) - [i20]Michal Moshkovitz, Naftali Tishby:
A General Memory-Bounded Learning Algorithm. CoRR abs/1712.03524 (2017) - 2016
- [j32]Jonathan Rubin, Nachum Ulanovsky, Israel Nelken, Naftali Tishby:
The Representation of Prediction Error in Auditory Cortex. PLoS Comput. Biol. 12(8) (2016) - [c85]Roy Fox, Naftali Tishby:
Minimum-information LQG control Part II: Retentive controllers. CDC 2016: 5603-5609 - [c84]Roy Fox, Naftali Tishby:
Minimum-information LQG control part I: Memoryless controllers. CDC 2016: 5610-5616 - [c83]Roy Fox, Ari Pakman, Naftali Tishby:
Taming the Noise in Reinforcement Learning via Soft Updates. UAI 2016 - [i19]Pedro A. Ortega, Naftali Tishby:
Memory controls time perception and intertemporal choices. CoRR abs/1604.05129 (2016) - [i18]Roy Fox, Naftali Tishby:
Minimum-Information LQG Control - Part I: Memoryless Controllers. CoRR abs/1606.01946 (2016) - [i17]Roy Fox, Naftali Tishby:
Minimum-Information LQG Control - Part II: Retentive Controllers. CoRR abs/1606.01947 (2016) - [i16]Roy Fox, Michal Moshkovitz, Naftali Tishby:
Principled Option Learning in Markov Decision Processes. CoRR abs/1609.05524 (2016) - [i15]Nadav Amir, Israel Nelken, Naftali Tishby:
A Simple Model of Attentional Blink. CoRR abs/1611.08913 (2016) - 2015
- [c82]Nadav Amir, Stas Tiomkin, Naftali Tishby:
Past-future Information Bottleneck for linear feedback systems. CDC 2015: 5737-5742 - [c81]Ron M. Hecht, Aharon Bar-Hillel, Stas Tiomkin, Hadar Levi, Omer Tsimhoni, Naftali Tishby:
Cognitive workload and vocabulary sparseness: theory and practice. INTERSPEECH 2015: 3394-3398 - [c80]Naftali Tishby, Noga Zaslavsky:
Deep learning and the information bottleneck principle. ITW 2015: 1-5 - [i14]Naftali Tishby, Noga Zaslavsky:
Deep Learning and the Information Bottleneck Principle. CoRR abs/1503.02406 (2015) - [i13]Pedro A. Ortega, Daniel A. Braun, Justin Dyer, Kee-Eung Kim, Naftali Tishby:
Information-Theoretic Bounded Rationality. CoRR abs/1512.06789 (2015) - [i12]Roy Fox, Ari Pakman, Naftali Tishby:
G-Learning: Taming the Noise in Reinforcement Learning via Soft Updates. CoRR abs/1512.08562 (2015) - [i11]Roy Fox, Naftali Tishby:
Optimal Selective Attention in Reactive Agents. CoRR abs/1512.08575 (2015) - 2014
- [c79]Pedro A. Ortega, Daniel A. Braun, Naftali Tishby:
Monte Carlo methods for exact & efficient solution of the generalized optimality equations. ICRA 2014: 4322-4327 - [c78]Michal Moshkovitz, Naftali Tishby:
Control your information for better predictions. ISIT 2014: 916-920 - 2013
- [j31]Sivan Sabato, Nathan Srebro, Naftali Tishby:
Distribution-dependent sample complexity of large margin learning. J. Mach. Learn. Res. 14(1): 2119-2149 (2013) - [j30]Ron M. Hecht, Elad Noor, Gil Dobry, Yaniv Zigel, Aharon Bar-Hillel, Naftali Tishby:
Effective Model Representation by Information Bottleneck Principle. IEEE Trans. Speech Audio Process. 21(8): 1755-1759 (2013) - [i10]Nir Friedman, Ori Mosenzon, Noam Slonim, Naftali Tishby:
Multivariate Information Bottleneck. CoRR abs/1301.2270 (2013) - 2012
- [j29]Sivan Sabato, Naftali Tishby:
Multi-instance learning with any hypothesis class. J. Mach. Learn. Res. 13: 2999-3039 (2012) - [c77]Roy Fox, Naftali Tishby:
Bounded Planning in Passive POMDPs. ICML 2012 - [i9]Sivan Sabato, Nati Srebro, Naftali Tishby:
Characterizing the Sample Complexity of Large-Margin Learning With Second-Order Statistics. CoRR abs/1204.1276 (2012) - [i8]Amir Globerson, Naftali Tishby:
The Minimum Information Principle for Discriminative Learning. CoRR abs/1207.4110 (2012) - [i7]Amir Globerson, Gal Chechik, Naftali Tishby:
Sufficient Dimensionality Reduction with Irrelevant Statistics. CoRR abs/1212.2483 (2012) - 2011
- [j28]Simone Calderara, Uri Heinemann, Andrea Prati, Rita Cucchiara, Naftali Tishby:
Detecting anomalies in people's trajectories using spectral graph analysis. Comput. Vis. Image Underst. 115(8): 1099-1111 (2011) - [c76]Ohad Shamir, Naftali Tishby:
Spectral Clustering on a Budget. AISTATS 2011: 661-669 - [i6]Sivan Sabato, Naftali Tishby:
Multi-Instance Learning with Any Hypothesis Class. CoRR abs/1107.2021 (2011) - 2010
- [j27]Yevgeny Seldin, Naftali Tishby:
PAC-Bayesian Analysis of Co-clustering and Beyond. J. Mach. Learn. Res. 11: 3595-3646 (2010) - [j26]Ohad Shamir, Naftali Tishby:
Stability and model selection in k-means clustering. Mach. Learn. 80(2-3): 213-243 (2010) - [j25]Ohad Shamir, Sivan Sabato, Naftali Tishby:
Learning and generalization with the information bottleneck. Theor. Comput. Sci. 411(29-30): 2696-2711 (2010) - [c75]Sivan Sabato, Nathan Srebro, Naftali Tishby:
Tight Sample Complexity of Large-Margin Learning. NIPS 2010: 2038-2046 - [c74]Sivan Sabato, Nathan Srebro, Naftali Tishby:
Reducing Label Complexity by Learning From Bags. AISTATS 2010: 685-692 - [i5]Sivan Sabato, Nathan Srebro, Naftali Tishby:
Tight Sample Complexity of Large-Margin Learning. CoRR abs/1011.5053 (2010)
2000 – 2009
- 2009
- [j24]Amir Globerson, Eran Stark, Eilon Vaadia, Naftali Tishby:
The minimum information principle and its application to neural code analysis. Proc. Natl. Acad. Sci. USA 106(9): 3490-3495 (2009) - [c73]Sivan Sabato, Naftali Tishby:
Homogeneous Multi-Instance Learning with Arbitrary Dependence. COLT 2009 - [c72]Ron M. Hecht, Omer Hezroni, Amit Manna, Gil Dobry, Yaniv Zigel, Naftali Tishby:
Information bottleneck based age verification. INTERSPEECH 2009: 188-191 - [c71]Ron M. Hecht, Elad Noor, Naftali Tishby:
Speaker recognition by Gaussian information bottleneck. INTERSPEECH 2009: 1567-1570 - [c70]Yevgeny Seldin, Naftali Tishby:
PAC-Bayesian Generalization Bound for Density Estimation with Application to Co-clustering. AISTATS 2009: 472-479 - 2008
- [j23]Eyal Krupka, Naftali Tishby:
Generalization from Observed to Unobserved Features by Clustering. J. Mach. Learn. Res. 9: 339-370 (2008) - [c69]Ohad Shamir, Sivan Sabato, Naftali Tishby:
Learning and Generalization with the Information Bottleneck. ALT 2008: 92-107 - [c68]Ohad Shamir, Naftali Tishby:
Model Selection and Stability in k-means Clustering. COLT 2008: 367-378 - [c67]Yevgeny Seldin, Naftali Tishby:
Multi-classification by categorical features via clustering. ICML 2008: 920-927 - [c66]Naftali Tishby:
Extracting Relevant Information from Samples. ISAIM 2008 - [c65]Ohad Shamir, Naftali Tishby:
On the Reliability of Clustering Stability in the Large Sample Regime. NIPS 2008: 1465-1472 - 2007
- [j22]Amir Globerson, Gal Chechik, Fernando Pereira, Naftali Tishby:
Euclidean Embedding of Co-occurrence Data. J. Mach. Learn. Res. 8: 2265-2295 (2007) - [j21]Hani Neuvirth, Uri Heinemann, David Birnbaum, Naftali Tishby, Gideon Schreiber:
ProMateus - an open research approach to protein-binding sites analysis. Nucleic Acids Res. 35(Web-Server-Issue): 543-548 (2007) - [c64]Peter Harremoës, Naftali Tishby:
The Information Bottleneck Revisited or How to Choose a Good Distortion Measure. ISIT 2007: 566-570 - [c63]Ohad Shamir, Naftali Tishby:
Cluster Stability for Finite Samples. NIPS 2007: 1297-1304 - [c62]Eyal Krupka, Naftali Tishby:
Incorporating Prior Knowledge on Features into Learning. AISTATS 2007: 227-234 - 2006
- [j20]Noam Slonim, Nir Friedman, Naftali Tishby:
Multivariate Information Bottleneck. Neural Comput. 18(8): 1739-1789 (2006) - [c61]Amir Globerson, Gal Chechik, Fernando Pereira, Naftali Tishby:
Embedding Heterogeneous Data Using Statistical Models. AAAI 2006: 1605-1608 - [c60]William Bialek, Robert R. de Ruyter van Steveninck, Naftali Tishby:
Efficient representation as a design principle for neural coding and computation. ISIT 2006: 659-663 - [c59]Yevgeny Seldin, Noam Slonim, Naftali Tishby:
Information Bottleneck for Non Co-Occurrence Data. NIPS 2006: 1241-1248 - [p1]Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
Large Margin Principles for Feature Selection. Feature Extraction 2006: 585-606 - 2005
- [j19]Gal Chechik, Amir Globerson, Naftali Tishby, Yair Weiss:
Information Bottleneck for Gaussian Variables. J. Mach. Learn. Res. 6: 165-188 (2005) - [c58]Ron M. Hecht, Naftali Tishby:
Extraction of relevant speech features using the information bottleneck method. INTERSPEECH 2005: 353-356 - [c57]Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
Query by Committee Made Real. NIPS 2005: 443-450 - [c56]Eyal Krupka, Naftali Tishby:
Generalization in Clustering with Unobserved Features. NIPS 2005: 683-690 - [c55]Amir Navot, Lavi Shpigelman, Naftali Tishby, Eilon Vaadia:
Nearest Neighbor Based Feature Selection for Regression and its Application to Neural Activity. NIPS 2005: 996-1002 - [c54]Amir Navot, Ran Gilad-Bachrach, Yiftah Navot, Naftali Tishby:
Is Feature Selection Still Necessary? SLSFS 2005: 127-138 - 2004
- [j18]Gill Bejerano, Nir Friedman, Naftali Tishby:
Efficient Exact p-Value Computation for Small Sample, Sparse, and Surprising Categorical Data. J. Comput. Biol. 11(5): 867-886 (2004) - [j17]Rivka Adar, Yaakov Benenson, Gregory Linshiz, Amit Rosner, Naftali Tishby, Ehud Shapiro:
Stochastic computing with biomolecular automata. Proc. Natl. Acad. Sci. USA 101(27): 9960-9965 (2004) - [c53]Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
Bayes and Tukey Meet at the Center Point. COLT 2004: 549-563 - [c52]Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
Margin based feature selection - theory and algorithms. ICML 2004 - [c51]Amir Globerson, Gal Chechik, Fernando C. N. Pereira, Naftali Tishby:
Euclidean Embedding of Co-Occurrence Data. NIPS 2004: 497-504 - [c50]Amir Globerson, Naftali Tishby:
The Minimum Information Principle for Discriminative Learning. UAI 2004: 193-200 - 2003
- [j16]Noam Slonim, Gill Bejerano, Shai Fine, Naftali Tishby:
Discriminative Feature Selection via Multiclass Variable Memory Markov Model. EURASIP J. Adv. Signal Process. 2003(2): 93-102 (2003) - [j15]Ron Bekkerman, Ran El-Yaniv, Naftali Tishby, Yoad Winter:
Distributional Word Clusters vs. Words for Text Categorization. J. Mach. Learn. Res. 3: 1183-1208 (2003) - [j14]Amir Globerson, Naftali Tishby:
Sufficient Dimensionality Reduction. J. Mach. Learn. Res. 3: 1307-1331 (2003) - [c49]Naftali Tishby:
Efficient Data Representations That Preserve Information. ALT 2003: 16 - [c48]Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
An Information Theoretic Tradeoff between Complexity and Accuracy. COLT 2003: 595-609 - [c47]Naftali Tishby:
Efficient Data Representations That Preserve Information. Discovery Science 2003: 45 - [c46]Gal Chechik, Amir Globerson, Naftali Tishby, Yair Weiss:
Information Bottleneck for Gaussian Variables. NIPS 2003: 1213-1220 - [c45]Amir Globerson, Gal Chechik, Naftali Tishby:
Sufficient Dimensionality Reduction with Irrelevance Statistics. UAI 2003: 281-288 - 2002
- [j13]Shlomo Dubnov, Ran El-Yaniv, Yoram Gdalyahu, Elad Schneidman, Naftali Tishby, Golan Yona:
A New Nonparametric Pairwise Clustering Algorithm Based on Iterative Estimation of Distance Profiles. Mach. Learn. 47(1): 35-61 (2002) - [c44]Amir Globerson, Naftali Tishby:
Most Informative Dimension Reduction. AAAI/IAAI 2002: 1024- - [c43]Amir Globerson, Naftali Tishby:
Sufficient Dimensionality Reduction - A novel Analysis Method. ICML 2002: 203-210 - [c42]Noam Slonim, Gill Bejerano, Shai Fine, Naftali Tishby:
Discriminative Feature Selection via Multiclass Variable Memory Markov Model. ICML 2002: 578-585 - [c41]Koby Crammer, Ran Gilad-Bachrach, Amir Navot, Naftali Tishby:
Margin Analysis of the LVQ Algorithm. NIPS 2002: 462-469 - [c40]Gal Chechik, Naftali Tishby:
Extracting Relevant Structures with Side Information. NIPS 2002: 857-864 - [c39]Noam Slonim, Nir Friedman, Naftali Tishby:
Unsupervised document classification using sequential information maximization. SIGIR 2002: 129-136 - 2001
- [j12]Gill Bejerano, Yevgeny Seldin, Hanah Margalit, Naftali Tishby:
Markovian domain fingerprinting: statistical segmentation of protein sequences. Bioinform. 17(10): 927-934 (2001) - [j11]William Bialek, Ilya Nemenman, Naftali Tishby:
Predictability, Complexity, and Learning. Neural Comput. 13(11): 2409-2463 (2001) - [j10]Itay Gat, Naftali Tishby:
Spotting Neural Spike Patterns Using an Adversary Background Model. Neural Comput. 13(12): 2681-2708 (2001) - [c38]Yevgeny Seldin, Gill Bejerano, Naftali Tishby:
Unsupervised Sequence Segmentation by a Mixture of Switching Variable Memory Markov Sources. ICML 2001: 513-520 - [c37]Gal Chechik, Amir Globerson, Michael J. Anderson, Eric D. Young, Israel Nelken, Naftali Tishby:
Group Redundancy Measures Reveal Redundancy Reduction in the Auditory Pathway. NIPS 2001: 173-180 - [c36]Noam Slonim, Nir Friedman, Naftali Tishby:
Agglomerative Multivariate Information Bottleneck. NIPS 2001: 929-936 - [c35]Ron Bekkerman, Ran El-Yaniv, Yoad Winter, Naftali Tishby:
On Feature Distributional Clustering for Text Categorization. SIGIR 2001: 146-153 - [c34]Nir Friedman, Ori Mosenzon, Noam Slonim, Naftali Tishby:
Multivariate Information Bottleneck. UAI 2001: 152-161 - 2000
- [c33]Shahar Mendelson, Naftali Tishby:
Statistical Sufficiency for Classes in Empirical L2 Spaces. COLT 2000: 81-89 - [c32]Gal Chechik, Naftali Tishby:
Temporally Dependent Plasticity: An Information Theoretic Account. NIPS 2000: 110-116 - [c31]Elad Schneidman, Naama Brenner, Naftali Tishby, Robert R. de Ruyter van Steveninck, William Bialek:
Universality and Individuality in a Neural Code. NIPS 2000: 159-165 - [c30]Naftali Tishby, Noam Slonim:
Data Clustering by Markovian Relaxation and the Information Bottleneck Method. NIPS 2000: 640-646 - [c29]Noam Slonim, Naftali Tishby:
Document clustering using word clusters via the information bottleneck method. SIGIR 2000: 208-215 - [i4]Naftali Tishby, Fernando C. N. Pereira, William Bialek:
The information bottleneck method. CoRR physics/0004057 (2000) - [i3]William Bialek, Ilya Nemenman, Naftali Tishby:
Predictability, complexity and learning. CoRR physics/0007070 (2000)
1990 – 1999
- 1999
- [c28]Elad Schneidman, Idan Segev, Naftali Tishby:
Information Capacity and Robustness of Stochastic Neuron Models. NIPS 1999: 178-184 - [c27]Noam Slonim, Naftali Tishby:
Agglomerative Information Bottleneck. NIPS 1999: 617-623 - 1998
- [j9]Dana Ron, Yoram Singer, Naftali Tishby:
On the Learnability and Usage of Acyclic Probabilistic Finite Automata. J. Comput. Syst. Sci. 56(2): 133-152 (1998) - [j8]Shai Fine, Yoram Singer, Naftali Tishby:
The Hierarchical Hidden Markov Model: Analysis and Applications. Mach. Learn. 32(1): 41-62 (1998) - [c26]Golan Yona, Nathan Linial, Naftali Tishby, Michal Linial:
A Map of the Protein Space: An Automatic Hierarchical Classification of all Protein Sequences. ISMB 1998: 212-221 - [c25]Itay Gat, Naftali Tishby:
Synergy and Redundancy among Brain Cells of Behaving Monkeys. NIPS 1998: 111-117 - [c24]Dmitry Rinberg, Hanan Davidowitz, Naftali Tishby:
Multi-Electrode Spike Sorting by Clustering Transfer Functions. NIPS 1998: 146-152 - [c23]Catriel Beeri, Gershon Elber, Tova Milo, Yehoshua Sagiv, Oded Shmueli, Naftali Tishby, Yakov A. Kogan, David Konopnicki, Pini Mogilevski, Noam Slonim:
WebSuite: A Tool Suite for Harnessing Web Data. WebDB 1998: 152-171 - 1997
- [j7]Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby:
Selective Sampling Using the Query by Committee Algorithm. Mach. Learn. 28(2-3): 133-168 (1997) - [c22]Shlomo Dubnov, Naftali Tishby:
Analysis of sound textures in musical and machine sounds by means of higher order statistical features. ICASSP 1997: 3845-3848 - [c21]Ran El-Yaniv, Shai Fine, Naftali Tishby:
Agnostic Classification of Markovian Sequences. NIPS 1997: 465-471 - 1996
- [j6]Dana Ron, Yoram Singer, Naftali Tishby:
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length. Mach. Learn. 25(2-3): 117-149 (1996) - [j5]David Haussler, Michael J. Kearns, H. Sebastian Seung, Naftali Tishby:
Rigorous Learning Curve Bounds from Statistical Mechanics. Mach. Learn. 25(2-3): 195-236 (1996) - [c20]Shlomo Dubnov, Naftali Tishby, Dalia Cohen:
Influence of Frequency Modulating Jitter on Higher Order Moments of Sound Residual with Applications to Synthesis and Classification. ICMC 1996 - [i2]Fernando C. N. Pereira, Yoram Singer, Naftali Tishby:
Beyond Word N-Grams. CoRR cmp-lg/9607016 (1996) - 1995
- [c19]Fernando Pereira, Yoram Singer, Naftali Tishby:
Beyond Word N-Grams. VLC@ACL 1995 - [c18]Dana Ron, Yoram Singer, Naftali Tishby:
On the Learnability and Usage of Acyclic Probabilistic Finite Automata. COLT 1995: 31-40 - [c17]Shlomo Dubnov, Naftali Tishby:
Clustering Musical Sounds Using Polyspectral Distance Measures. ICMC 1995 - 1994
- [j4]Yoram Singer, Naftali Tishby:
Dynamical encoding of cursive handwriting. Biol. Cybern. 71(3): 227-237 (1994) - [j3]Naftali Tishby, Allen L. Gorin:
Algebraic learning of statistical associations for language acquisition. Comput. Speech Lang. 8(1): 51-78 (1994) - [c16]Dana Ron, Yoram Singer, Naftali Tishby:
Learning Probabilistic Automata with Variable Memory Length. COLT 1994: 35-46 - [c15]David Haussler, H. Sebastian Seung, Michael J. Kearns, Naftali Tishby:
Rigorous Learning Curve Bounds from Statistical Mechanics. COLT 1994: 76-87 - [c14]Daphna Weinshall, Michael Werman, Naftali Tishby:
Stability and Likelihood of Views of Three Dimensional Objects. ECCV (1) 1994: 24-35 - [c13]Shlomo Dubnov, Naftali Tishby:
Acoustic spectral estimation using higher order statistics. ICPR (3) 1994: 1-5 - [c12]Daphna Weinshall, Michael Werman, Naftali Tishby:
Stability and Likelihood of Views of Three Dimensional Objects. Theoretical Foundations of Computer Vision 1994: 237-256 - [i1]Fernando C. N. Pereira, Naftali Tishby, Lillian Lee:
Distributional Clustering of English Words. CoRR abs/cmp-lg/9408011 (1994) - 1993
- [c11]Fernando C. N. Pereira, Naftali Tishby, Lillian Lee:
Distributional Clustering of English Words. ACL 1993: 183-190 - [c10]Yoram Singer, Naftali Tishby:
Dynamical encoding of cursive handwriting. CVPR 1993: 341-346 - [c9]Dana Ron, Yoram Singer, Naftali Tishby:
The Power of Amnesia. NIPS 1993: 176-183 - [c8]Scott Kirkpatrick, Géza Györgyi, Naftali Tishby, Lidror Troyansky:
The Statistical Mechanics of k-Satisfaction. NIPS 1993: 439-446 - [c7]Yoram Singer, Naftali Tishby:
Decoding Cursive Scripts. NIPS 1993: 833-840 - 1992
- [c6]Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby:
Information, Prediction, and Query by Committee. NIPS 1992: 483-490 - [c5]Itay Gat, Naftali Tishby:
Statistical Modeling of Cell Assemblies Activities in Associative Cortex of Behaving Monkeys. NIPS 1992: 945-952 - 1991
- [c4]H. Sebastian Seung, Haim Sompolinsky, Naftali Tishby:
Learning Curves in Large Neural Networks. COLT 1991: 112-127 - 1990
- [j2]Esther Levin, Naftali Tishby, Sara A. Solla:
A statistical approach to learning and generalization in layered neural networks. Proc. IEEE 78(10): 1568-1574 (1990) - [c3]Naftali Tishby:
A dynamical systems approach to speech processing. ICASSP 1990: 365-368
1980 – 1989
- 1989
- [c2]Esther Levin, Naftali Tishby, Sara A. Solla:
A Statistical Approach to Learning and Generalization in Layered Neural Networks. COLT 1989: 245-260 - 1988
- [j1]Naftali Tishby:
Nonlinear dynamical modeling of speech using neural networks. Neural Networks 1(Supplement-1): 279 (1988) - [c1]Naftali Tishby:
Information theoretic factorization of speaker and language in hidden Markov models, with application to speaker recognition. ICASSP 1988: 87-90
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint