Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlon Orlitsky
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i26]Ayush Jain, Rajat Sen, Weihao Kong, Abhimanyu Das, Alon Orlitsky:
Linear Regression using Heterogeneous Data Batches. CoRR abs/2309.01973 (2023)- 2022
- [c83]Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar:
TURF: Two-Factor, Universal, Robust, Fast Distribution Learning Algorithm. ICML 2022: 8427-8445 - [i25]Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar:
Robust estimation algorithms don't need to know the corruption level. CoRR abs/2202.05453 (2022) - [i24]Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar:
TURF: A Two-factor, Universal, Robust, Fast Distribution Learning Algorithm. CoRR abs/2202.07172 (2022) - 2021
- [c82]Yi Hao, Alon Orlitsky:
Compressed Maximum Likelihood. ICML 2021: 4085-4095 - [c81]Ayush Jain, Alon Orlitsky:
Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free. ICML 2021: 4698-4708 - 2020
- [c80]Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati:
Towards Competitive N-gram Smoothing. AISTATS 2020: 4206-4215 - [c79]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati:
Optimal Sequential Maximization: One Interview is Enough! ICML 2020: 2975-2984 - [c78]Yi Hao, Alon Orlitsky:
Data Amplification: Instance-Optimal Property Estimation. ICML 2020: 4049-4059 - [c77]Ayush Jain, Alon Orlitsky:
Optimal Robust Learning of Discrete Distributions from Batches. ICML 2020: 4651-4660 - [c76]Sudeep Kamath, Alon Orlitsky, Venkatadheeraj Pichapati, Ehsan Zobeidi:
On Learning Parametric Non-Smooth Continuous Distributions. ISIT 2020: 2574-2579 - [c75]Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar:
SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm. NeurIPS 2020 - [c74]Yi Hao, Alon Orlitsky:
Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions. NeurIPS 2020 - [c73]Ayush Jain, Alon Orlitsky:
Linear-Sample Learning of Low-Rank Distributions. NeurIPS 2020 - [c72]Ayush Jain, Alon Orlitsky:
A General Method for Robust Learning from Batches. NeurIPS 2020 - [i23]Yi Hao, Ayush Jain, Alon Orlitsky, Vaishakh Ravindrakumar:
SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm. CoRR abs/2002.09589 (2020) - [i22]Ayush Jain, Alon Orlitsky:
A General Method for Robust Learning from Batches. CoRR abs/2002.11099 (2020) - [i21]Yi Hao, Alon Orlitsky:
Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions. CoRR abs/2002.11665 (2020) - [i20]Ayush Jain, Alon Orlitsky:
Linear-Sample Learning of Low-Rank Distributions. CoRR abs/2010.00064 (2020)
2010 – 2019
- 2019
- [c71]Yi Hao, Alon Orlitsky:
Doubly-Competitive Distribution Estimation. ICML 2019: 2614-2623 - [c70]Yi Hao, Alon Orlitsky:
The Broad Optimality of Profile Maximum Likelihood. NeurIPS 2019: 10989-11001 - [c69]Yi Hao, Alon Orlitsky:
Unified Sample-Optimal Property Estimation in Near-Linear Time. NeurIPS 2019: 11104-11114 - [i19]Yi Hao, Alon Orlitsky:
Data Amplification: Instance-Optimal Property Estimation. CoRR abs/1903.01432 (2019) - [i18]Yi Hao, Alon Orlitsky, Ananda Theertha Suresh, Yihong Wu:
Data Amplification: A Unified and Competitive Approach to Property Estimation. CoRR abs/1904.00070 (2019) - [i17]Yi Hao, Alon Orlitsky:
The Broad Optimality of Profile Maximum Likelihood. CoRR abs/1906.03794 (2019) - [i16]Yi Hao, Alon Orlitsky:
Unified Sample-Optimal Property Estimation in Near-Linear Time. CoRR abs/1911.03105 (2019) - [i15]Ayush Jain, Alon Orlitsky:
Robust Learning of Discrete Distributions from Batches. CoRR abs/1911.08532 (2019) - 2018
- [j34]Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Maximum Selection and Sorting with Adversarial Comparators. J. Mach. Learn. Res. 19: 59:1-59:31 (2018) - [c68]Moein Falahatgar, Ayush Jain, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar:
The Limits of Maxing, Ranking, and Preference Learning. ICML 2018: 1426-1435 - [c67]Yi Hao, Alon Orlitsky:
Adaptive Estimation of Generalized Distance to Uniformity. ISIT 2018: 1076-1080 - [c66]Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati:
On Learning Markov Chains. NeurIPS 2018: 646-655 - [c65]Yi Hao, Alon Orlitsky, Ananda Theertha Suresh, Yihong Wu:
Data Amplification: A Unified and Competitive Approach to Property Estimation. NeurIPS 2018: 8848-8857 - [i14]Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati:
On Learning Markov Chains. CoRR abs/1810.11754 (2018) - 2017
- [j33]Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi
:
Estimating Renyi Entropy of Discrete Distributions. IEEE Trans. Inf. Theory 63(1): 38-56 (2017) - [c64]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh:
A Unified Maximum Likelihood Approach for Estimating Symmetric Properties of Discrete Distributions. ICML 2017: 11-21 - [c63]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Maximum Selection and Ranking under Noisy Comparisons. ICML 2017: 1088-1096 - [c62]Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky, Venkatadheeraj Pichapati:
The power of absolute discounting: all-dimensional distribution estimation. NIPS 2017: 6660-6669 - [c61]Moein Falahatgar, Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar:
Maxing and Ranking with Few Assumptions. NIPS 2017: 7060-7070 - [i13]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Maximum Selection and Ranking under Noisy Comparisons. CoRR abs/1705.05366 (2017) - 2016
- [c60]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Estimating the number of defectives with group testing. ISIT 2016: 1376-1380 - [c59]Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Learning Markov distributions: Does estimation trump compression? ISIT 2016: 2689-2693 - [c58]Moein Falahatgar, Mesrob I. Ohannessian, Alon Orlitsky:
Near-Optimal Smoothing of Structured Conditional Probability Matrices. NIPS 2016: 4853-4861 - [i12]Jayadev Acharya, Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation. CoRR abs/1606.02786 (2016) - [i11]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh:
A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation. CoRR abs/1611.02960 (2016) - [i10]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh:
A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j32]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. SIAM J. Discret. Math. 29(3): 1340-1371 (2015) - [c57]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Faster Algorithms for Testing under Conditional Sampling. COLT 2015: 607-636 - [c56]Sudeep Kamath, Alon Orlitsky, Dheeraj Pichapati, Ananda Theertha Suresh:
On Learning Distributions from their Samples. COLT 2015: 1066-1100 - [c55]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Universal compression of power-law distributions. ISIT 2015: 2001-2005 - [c54]Alon Orlitsky, Ananda Theertha Suresh:
Competitive Distribution Estimation: Why is Good-Turing Good. NIPS 2015: 2143-2151 - [c53]Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi:
The Complexity of Estimating Rényi Entropy. SODA 2015: 1855-1869 - [i9]Alon Orlitsky, Ananda Theertha Suresh:
Competitive Distribution Estimation. CoRR abs/1503.07940 (2015) - [i8]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapathi, Ananda Theertha Suresh:
Faster Algorithms for Testing under Conditional Sampling. CoRR abs/1504.04103 (2015) - [i7]Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Universal Compression of Power-Law Distributions. CoRR abs/1504.08070 (2015) - 2014
- [c52]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
Quadratic-backtracking algorithm for string reconstruction from substring compositions. ISIT 2014: 1296-1300 - [c51]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Sorting with adversarial comparators and application to density estimation. ISIT 2014: 1682-1686 - [c50]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Efficient compression of monotone and m-modal distributions. ISIT 2014: 1867-1871 - [c49]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Poissonization and universal compression of envelope classes. ISIT 2014: 1872-1876 - [c48]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Sublinear algorithms for outlier detection and generalized closeness testing. ISIT 2014: 3200-3204 - [c47]Ananda Theertha Suresh, Alon Orlitsky, Jayadev Acharya, Ashkan Jafarpour:
Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures. NIPS 2014: 1395-1403 - [i6]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Near-optimal-sample estimators for spherical Gaussian mixtures. CoRR abs/1402.4746 (2014) - [i5]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. CoRR abs/1403.2439 (2014) - [i4]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Universal Compression of Envelope Classes: Tight Characterization via Poisson Sampling. CoRR abs/1405.7460 (2014) - [i3]Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi:
The Complexity of Estimating Rényi Entropy. CoRR abs/1408.1000 (2014) - [i2]Alon Orlitsky, Narayana P. Santhanam:
Universal compression of Gaussian sources with unknown parameters. CoRR abs/1410.4550 (2014) - 2013
- [j31]Panganamala Ramana Kumar, Eyal Kushilevitz, D. Manjunath, Muriel Médard, Alon Orlitsky, R. Srikant:
Guest Editorial: In-Network Computation: Exploring the Fundamental Limits. IEEE J. Sel. Areas Commun. 31(4): 617-619 (2013) - [c46]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
A Competitive Test for Uniformity of Monotone Distributions. AISTATS 2013: 57-65 - [c45]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Optimal Probability Estimation with Applications to Prediction and Classification. COLT 2013: 764-796 - [c44]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Tight bounds for universal compression of large alphabets. ISIT 2013: 2875-2879 - 2012
- [c43]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Estimating multiple concurrent processes. ISIT 2012: 1628-1632 - [c42]Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh:
On the query computation and verification of functions. ISIT 2012: 2711-2715 - [c41]Jayadev Acharya, Hirakendu Das, Alon Orlitsky:
Tight Bounds on Profile Redundancy and Distinguishability. NIPS 2012: 3266-3274 - [c40]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh:
Competitive Classification and Closeness Testing. COLT 2012: 22.1-22.18 - [i1]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
On Modeling Profiles instead of Values. CoRR abs/1207.4175 (2012) - 2011
- [c39]Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky:
Expected query complexity of symmetric boolean functions. Allerton 2011: 26-29 - [c38]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan:
Algebraic computation of pattern maximum likelihood. ISIT 2011: 400-404 - [c37]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Competitive Closeness Testing. COLT 2011: 47-68 - 2010
- [j30]Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky:
Silence-based communication. IEEE Trans. Inf. Theory 56(1): 350-366 (2010) - [c36]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
On reconstructing a string from its substring compositions. ISIT 2010: 1238-1242 - [c35]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam:
Classification using pattern probability estimators. ISIT 2010: 1493-1497 - [c34]Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan:
Exact calculation of pattern probabilities. ISIT 2010: 1498-1502
2000 – 2009
- 2009
- [c33]Alon Orlitsky, Shengjun Pan:
The maximum likelihood probability of skewed patterns. ISIT 2009: 1130-1134 - [c32]Shengjun Pan, Jayadev Acharya, Alon Orlitsky:
The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns. ISIT 2009: 1135-1139 - [c31]Jayadev Acharya, Alon Orlitsky, Shengjun Pan:
Recent results on pattern maximum likelihood. ITW 2009: 251-255 - 2008
- [c30]Hirakendu Das, Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Further results on relative redundancy. ISIT 2008: 1940-1943 - 2007
- [c29]Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky:
Single versus multiple rounds for distributed function computation. ISIT 2007: 636-640 - [c28]Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan:
Population estimation with performance guarantees. ISIT 2007: 2026-2030 - 2006
- [j29]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Limit Results on Pattern Entropy. IEEE Trans. Inf. Theory 52(7): 2954-2964 (2006) - [j28]Anand K. Dhulipala, Alon Orlitsky:
Universal Compression of Markov and Related Sources Over Arbitrary Alphabets. IEEE Trans. Inf. Theory 52(9): 4182-4190 (2006) - [c27]Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky:
Silence Based Communication for Sensor Networks. ISIT 2006: 212-216 - [c26]Alon Orlitsky, Narayana Santhanam, Junan Zhang:
Relative redundancy for large alphabets. ISIT 2006: 2672-2676 - [c25]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Theoretical and Experimental Results on Modeling Low Probabilities. ITW 2006: 242-246 - [p1]Alon Orlitsky:
Modifying Distances. Semi-Supervised Learning 2006: 309-330 - 2005
- [j27]Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam:
A lower bound on compression of unknown alphabets. Theor. Comput. Sci. 332(1-3): 293-311 (2005) - [j26]Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang:
Stopping set distribution of LDPC code ensembles. IEEE Trans. Inf. Theory 51(3): 929-953 (2005) - [c24]Sajama, Alon Orlitsky:
Estimating and computing density based distance metrics. ICML 2005: 760-767 - [c23]Sajama, Alon Orlitsky:
Supervised dimensionality reduction using mixture models. ICML 2005: 768-775 - [c22]Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang:
Convergence of profile based estimators. ISIT 2005: 1843-1847 - [c21]Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang:
Innovation and pattern entropy of stationary processes. ISIT 2005: 2203-2207 - 2004
- [j25]Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Universal compression of memoryless sources over unknown alphabets. IEEE Trans. Inf. Theory 50(7): 1469-1481 (2004) - [j24]Alon Orlitsky, Narayana P. Santhanam:
Speaking of infinity [i.i.d. strings]. IEEE Trans. Inf. Theory 50(10): 2215-2230 (2004) - [c20]Anand K. Dhulipala, Alon Orlitsky:
On the redundancy of HMM patterns. ISIT 2004: 9 - [c19]Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Relative redundancy: a more stringent performance guarantee for universal compression. ISIT 2004: 25 - [c18]Alon Orlitsky, Sajama, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Algorithms for modeling distributions over large alphabets. ISIT 2004: 306 - [c17]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Limit results on pattern entropy. ITW 2004: 99-104 - [c16]Sajama, Alon Orlitsky:
Semi-parametric Exponential Family PCA. NIPS 2004: 1177-1184 - [c15]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
On Modeling Profiles Instead of Values. UAI 2004: 426-435 - 2003
- [j23]Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky:
On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines. J. Mach. Learn. Res. 4: 1-15 (2003) - [j22]Alon Orlitsky, Krishnamurthy Viswanathan:
One-way communication and error-correcting codes. IEEE Trans. Inf. Theory 49(7): 1781-1788 (2003) - [c14]Yoav Freund, Alon Orlitsky, Prasad Santhanam, Junan Zhang:
Universal Coding of Zipf Distributions. COLT 2003: 736-737 - [c13]Alon Orlitsky, Narayana P. Santhanam:
Performance of universal codes over infinite alphabets. DCC 2003: 402-412 - [c12]Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Always Good Turing: Asymptotically Optimal Probability Estimation. FOCS 2003: 179-188 - [c11]Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky:
Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers. ICML 2003: 353-360 - 2002
- [j21]Alon Orlitsky:
Scalar versus vector quantization: Worst case analysis. IEEE Trans. Inf. Theory 48(6): 1393-1409 (2002) - [c10]Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky:
Combined binary classifiers with applications to speech recognition. INTERSPEECH 2002: 2469-2472 - 2001
- [j20]Bruce E. Moision, Alon Orlitsky, Paul H. Siegel:
On codes that avoid specified differences. IEEE Trans. Inf. Theory 47(1): 433-442 (2001) - [j19]Alon Orlitsky, James R. Roche:
Coding for computing. IEEE Trans. Inf. Theory 47(3): 903-917 (2001) - 2000
- [c9]Aldebaro Klautau, Nikola Jevtic, Alon Orlitsky:
Server-assisted speech recognition over the Internet. ICASSP 2000: 3690-3693
1990 – 1999
- 1998
- [j18]János Körner, Alon Orlitsky:
Zero-Error Information Theory. IEEE Trans. Inf. Theory 44(6): 2207-2229 (1998) - [j17]Alfred M. Bruckstein, Lawrence O'Gorman, Alon Orlitsky:
Design of Shapes for Precise Image Registration. IEEE Trans. Inf. Theory 44(7): 3156-3162 (1998) - 1996
- [j16]Alon Orlitsky, Santosh S. Venkatesh:
On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. Discret. Appl. Math. 64(2): 151-178 (1996) - [j15]Noga Alon, Alon Orlitsky:
Source coding and graph entropies. IEEE Trans. Inf. Theory 42(5): 1329-1339 (1996) - 1995
- [j14]Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath:
Vector Analysis of Threshold Functions. Inf. Comput. 120(1): 22-31 (1995) - [j13]Noga Alon, Alon Orlitsky:
Repeated communication and Ramsey graphs. IEEE Trans. Inf. Theory 41(5): 1276-1289 (1995) - [c8]