Table of Contents

• MEMR: A Margin Equipped Monotone Retargeting Framework for RankingSreangsu Acharyya, Joydeep Ghosh. 2-11 [doi]
• On Convergence and Optimality of Best-Response Learning with Policy Types in Multiagent SystemsStefano V. Albrecht, Subramanian Ramamoorthy. 12-21 [doi]
• Accelerating MCMC via Parallel Predictive PrefetchingElaine Angelino, Eddie Kohler, Amos Waterland, Margo Seltzer, Ryan P. Adams. 22-31 [doi]
• A variational approach to stable principal component pursuitAleksandr Y. Aravkin, Stephen Becker, Volkan Cevher, Peder A. Olsen. 32-41 [doi]
• Markov Network Structure Learning via Ensemble-of-Forests ModelsEirini Arvaniti, Manfred Claassen. 42-51 [doi]
• CAN(PLAN)+: Extending the Operational Semantics of the BDI Architecture to deal with Uncertain InformationKim Bauters, Weiru Liu, Jun Hong, Carles Sierra, Lluis Godo. 52-61 [doi]
• Message Passing for Soft Constraint Dual DecompositionDavid Belanger, Alexandre Passos, Sebastian Riedel, Andrew McCallum. 62-71 [doi]
• Bayesian Interactive Decision Support for Multi-Attribute Problems with Even SwapsDebarun Bhattacharjya, Jeffrey O. Kephart. 72-81 [doi]
• Learning to Predict from Crowdsourced DataWei Bi, Liwei Wang, James T. Kwok, Zhuowen Tu. 82-91 [doi]
• Lifted Tree-Reweighted Variational InferenceHung H. Bui, Tuyen N. Huynh, David Sontag. 92-101 [doi]
• Approximate Decentralized Bayesian InferenceTrevor Campbell, Jonathan P. How. 102-111 [doi]
• Inferring latent structures via information inequalitiesRafael Chaves, Lukas Luft, Thiago O. Maciel, David Gross, Dominik Janzing, Bernhard Schölkopf. 112-121 [doi]
• Near-optimal Adaptive Pool-based Active Learning with General LossNguyen Viet Cuong, Wee Sun Lee, Nan Ye. 122-131 [doi]
• A Permutation-Based Kernel Conditional Independence TestGary Doran, Krikamol Muandet, Kun Zhang, Bernhard Schölkopf. 132-141 [doi]
• Parallel Markov Chain Monte Carlo for Pitman-Yor Mixture ModelsKumar Dubey, Sinead Williamson, Eric P. Xing. 142-151 [doi]
• Market Making with Decreasing Utility for InformationMiroslav Dudík, Rafael M. Frongillo, Jennifer Wortman Vaughan. 152-161 [doi]
• Universal Convexification via Risk-AversionKrishnamurthy Dvijotham, Maryam Fazel, Emanuel Todorov. 162-171 [doi]
• Structured Proportional Jump ProcessesTal El-Hay, Omer Weissbrod, Elad Eban, Maurizio Zazzi, Francesca Incardona. 172-181 [doi]
• Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive DomainsEdith Elkind, Nisarg Shah 0001. 182-191 [doi]
• Iterative Splits of Quadratic Bounds for Scalable Binary Tensor FactorizationBeyza Ermis, Guillaume Bouchard. 192-199 [doi]
• Finding Optimal Bayesian Network Structures with Constraints Learned from DataXiannian Fan, Brandon M. Malone, Changhe Yuan. 200-209 [doi]
• Bisimulation Metrics are Optimal Value FunctionsNorman Ferns, Doina Precup. 210-219 [doi]
• Annealing Paths for the Evaluation of Topic ModelsJames R. Foulds, Padhraic Smyth. 220-229 [doi]
• Active Learning of Linear Embeddings for Gaussian ProcessesRoman Garnett, Michael A. Osborne, Philipp Hennig. 230-239 [doi]
• Estimating Causal Effects by Bounding ConfoundingPhilipp Geiger, Dominik Janzing, Bernhard Schölkopf. 240-249 [doi]
• Bayesian Optimization with Unknown ConstraintsMichael A. Gelbart, Jasper Snoek, Ryan P. Adams. 250-259 [doi]
• Nonparametric Clustering with Distance Dependent HierarchiesSoumya Ghosh, Michalis Raptis, Leonid Sigal, Erik B. Sudderth. 260-269 [doi]
• Transformation-based Probabilistic Clustering with SupervisionSiddharth Gopal, Yiming Yang. 270-279 [doi]
• Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model CountingEric Gribkoff, Guy Van den Broeck, Dan Suciu. 280-289 [doi]
• Interactive Learning from Unlabeled InstructionsJonathan Grizou, Iñaki Iturrate, Luis Montesano, Pierre-Yves Oudeyer, Manuel Lopes. 290-299 [doi]
• Batch-Mode Active Learning via Error Bound MinimizationQuanquan Gu, Tong Zhang 0001, Jiawei Han. 300-309 [doi]
• Efficient Bayesian Nonparametric Modelling of Structured Point ProcessesTom Gunter, Chris M. Lloyd, Michael A. Osborne, Stephen J. Roberts. 310-319 [doi]
• Learning Peptide-Spectrum Alignment Models for Tandem Mass SpectrometryJohn Halloran, Jeff A. Bilmes, William Stafford Noble. 320-329 [doi]
• Off-policy TD( l) with a true online equivalenceHado van Hasselt, Ashique Rupam Mahmood, Richard S. Sutton. 330-339 [doi]
• Constraint-based Causal Discovery: Conflict Resolution with Answer Set ProgrammingAntti Hyttinen, Frederick Eberhardt, Matti Järvisalo. 340-349 [doi]
• Generating structure of latent variable models for nested dataMasakazu Ishihata, Tomoharu Iwata. 350-359 [doi]
• Monotone Closure of Relaxed Constraints in Submodular Optimization: Connections Between Minimization and MaximizationRishabh K. Iyer, Stefanie Jegelka, Jeff A. Bilmes. 360-369 [doi]
• Min-d-Occur: Ensuring Future Occurrences in Streaming SetsVidit Jain, Sainyam Galhotra. 370-379 [doi]
• Instance Label Prediction by Dirichlet Process Multiple Instance LearningMelih Kandemir, Fred A. Hamprecht. 380-389 [doi]
• Closed-form Solutions to a Subclass of Continuous Stochastic Games via Symbolic Dynamic ProgrammingShamin Kinathil, Scott Sanner, Nicolás Della Penna. 390-399 [doi]
• Recursive Best-First AND/OR Search for Optimization in Graphical ModelsAkihiro Kishomoto, Radu Marinescu 0002. 400-409 [doi]
• Saturated Conditional Independence with Fixed and Undetermined Sets of Incomplete Random VariablesHenning Köhler, Sebastian Link. 410-419 [doi]
• Matroid Bandits: Fast Combinatorial Optimization with LearningBranislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, Brian Eriksson. 420-429 [doi]
• Multi-label Image Classification with A Probabilistic Label Enhancement ModelXin Li 0013, Feipeng Zhao, Yuhong Guo. 430-439 [doi]
• Sequential Model-Based Ensemble OptimizationAlexandre Lacoste, Hugo Larochelle, Mario Marchand, François Laviolette. 440-448 [doi]
• Position-Aware ListMLE: A Sequential Learning Process for RankingYanyan Lan, Yadong Zhu, Jiafeng Guo, Shuzi Niu, Xueqi Cheng. 449-458 [doi]
• Continuously indexed Potts models on unoriented graphsLandrieu Loic, Guillaume Obozinski. 459-468 [doi]
• Efficient Inference of Gaussian-Process-Modulated Renewal Processes with Application to Medical Event DataThomas Lasko. 469-476 [doi]
• Optimal Resource Allocation with Semi-Bandit FeedbackTor Lattimore, Koby Crammer, Csaba Szepesvári. 477-486 [doi]
• Quantifying Nonlocal Informativeness in High-Dimensional, Loopy Gaussian Graphical ModelsDaniel S. Levine 0002, Jonathan P. How. 487-495 [doi]
• CoRE KernelsPing Li. 496-504 [doi]
• Efficient Sparse Recovery via Adaptive Non-Convex Regularizers with Oracle PropertyMing Lin, Rong Jin, Changshui Zhang. 505-514 [doi]
• Nuclear Norm Regularized Least Squares Optimization on Grassmannian ManifoldsYuanyuan Liu, Fanhua Shang, Hong Cheng, James Cheng. 515-524 [doi]
• Fast Ridge Regression with Randomized Principal Component Analysis and Gradient DescentYichao Lu, Dean P. Foster. 525-532 [doi]
• Adaptive Monotone Shrinkage for RegressionZhuang Ma, Dean P. Foster, Robert A. Stine. 533-542 [doi]
• Firefly Monte Carlo: Exact MCMC with Subsets of DataDougal Maclaurin, Ryan P. Adams. 543-552 [doi]
• Sequential Bayesian Optimisation for Spatial-Temporal MonitoringRomán Marchant, Fabio Ramos, Scott Sanner. 553-562 [doi]
• AND/OR Search for Marginal MAPRadu Marinescu 0002, Rina Dechter, Alexander T. Ihler. 563-572 [doi]
• Stochastic Discriminative EMAndrés Masegosa. 573-582 [doi]
• Latent Kullback Leibler Control for Continuous-State Systems using Probabilistic Graphical ModelsTakamitsu Matsubara, Vicenç Gómez, Hilbert J. Kappen. 583-592 [doi]
• GPS-ABC: Gaussian Process Surrogate Approximate Bayesian ComputationEdward Meeds, Max Welling. 593-602 [doi]
• Lifted Message Passing as Reparametrization of Graphical ModelsMartin Mladenov, Amir Globerson, Kristian Kersting. 603-612 [doi]
• Fast Gaussian Process Posteriors with Product TreesDavid A. Moore, Stuart J. Russell. 613-622 [doi]
• Asymptotically Exact, Embarrassingly Parallel MCMCWillie Neiswanger, Chong Wang, Eric P. Xing. 623-632 [doi]
• Modeling Citation Networks Using Latent Random OffsetsWillie Neiswanger, Chong Wang, Qirong Ho, Eric P. Xing. 633-642 [doi]
• Collaborative Multi-output Gaussian ProcessesTrung V. Nguyen, Edwin V. Bonilla. 643-652 [doi]
• Combining predictions from linear models when training and test inputs differThijs van Ommen. 653-662 [doi]
• Optimal amortized regret in every intervalRina Panigrahy, Preyas Popat. 663-671 [doi]
• Learning Partial Policies to Speedup MDP Tree SearchJervis Pinto, Alan Fern. 672-681 [doi]
• Estimating Accuracy from Unlabeled DataEmmanouil Antonios Platanios, Avrim Blum, Tom M. Mitchell. 682-691 [doi]
• k-NN Regression on Functional Data with Incomplete ObservationsSashank J. Reddi, Barnabás Póczos. 692-701 [doi]
• Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree ConstraintsDaniel J. Rosenkrantz, Madhav V. Marathe, Ravi Sundaram, Anil Vullikanti. 702-711 [doi]
• SPPM: Sparse Privacy Preserving MappingsSalman Salamatian, Nadia Fawaz, Branislav Kveton, Nina Taft. 712-721 [doi]
• Correlated Compressive Sensing for Networked DataTianlin Shi, Da Tang, Liwen Xu, Thomas Moscibroda. 722-731 [doi]
• Improved Densification of One Permutation HashingAnshumali Shrivastava, Ping Li 0001. 732-741 [doi]
• First-Order Open-Universe POMDPsSiddharth Srivastava 0001, Stuart Russell 0001, Paul Ruan, Xiang Cheng 0006. 742-751 [doi]
• A Hierarchical Switching Linear Dynamical System Applied to the Detection of Sepsis in Neonatal Condition MonitoringIoan Stanculescu, Christopher K. I. Williams, Yvonne Freer. 752-761 [doi]
• A Spectral Algorithm for Learning Class-Based n-gram Models of Natural LanguageKarl Stratos, Do-kyum Kim, Michael Collins, Daniel Hsu. 762-771 [doi]
• Inference Complexity in Continuous Time Bayesian NetworksLiessman Sturlaugson, John W. Sheppard. 772-779 [doi]
• Model Regularization for Stable Sample RolloutsErik Talvitie. 780-789 [doi]
• HELM: Highly Efficient Learning of Mixed copula networksYaniv Tenzer, Gal Elidan. 790-799 [doi]
• Metrics for Probabilistic GeometriesAlessandra Tosi, Søren Hauberg, Alfredo Vellido, Neil D. Lawrence. 800-808 [doi]
• Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search AuctionsLong Tran-Thanh, Lampros C. Stavrogiannis, Victor Naroditskiy, Valentin Robu, Nicholas R. Jennings, Peter Key. 809-818 [doi]
• A Consistent Estimator of the Expected Gradient OuterproductShubhendu Trivedi, Jialei Wang, Samory Kpotufe, Gregory Shakhnarovich. 819-828 [doi]
• Venn-Abers PredictorsVladimir Vovk, Ivan Petej. 829-838 [doi]
• Tightness Results for Local Consistency Relaxations in Continuous MRFsYoav Wald, Amir Globerson. 839-848 [doi]
• Bayesian Filtering with Online Gaussian Process Latent Variable ModelsYali Wang, Marcus A. Brubaker, Brahim Chaib-draa, Raquel Urtasun. 849-857 [doi]
• Approximating the Bethe Partition FunctionAdrian Weller, Tony Jebara. 858-867 [doi]
• Understanding the Bethe Approximation: When and How can it go Wrong?Adrian Weller, Kui Tang, Tony Jebara, David Sontag. 868-877 [doi]
• A Bayesian Nonparametric Model for Spectral Estimation of Metastable SystemsHao Wu. 878-887 [doi]
• Fast Newton methods for the group fused lassoMatt Wytock, Suvrit Sra, Jeremy Z. Kolter. 888-897 [doi]
• Learning from Point Sets with Observational BiasLiang Xiong, Jeff G. Schneider. 898-906 [doi]
• Constructing Separators and Adjustment Sets in Ancestral GraphsBenito van der Zander, Maciej Liskiewicz, Johannes Textor. 907-916 [doi]
• Belief-Kinematics Jeffrey-s Rules in the Theory of EvidenceChunlai Zhou, Mingyue Wang, Biao Qin. 917-926 [doi]