text
stringlengths
2.85k
2.55M
label
int64
0
10
arXiv:1712.00123v1 [stat.ML] 30 Nov 2017 Label Efficient Learning of Transferable Representations across Domains and Tasks Zelun Luo Stanford University zelunluo@stanford.edu Yuliang Zou Virginia Tech ylzou@vt.edu Judy Hoffman University of California, Berkeley jhoffman@eecs.berkeley.edu Li Fei-Fei Stanford Univer...
1
1 Resource Allocation for D2D Communications Underlaying a NOMA-Based Cellular Network Yijin Pan, Cunhua Pan, Zhaohui Yang, Ming Chen Abstract arXiv:1710.05149v1 [cs.IT] 14 Oct 2017 This letter investigates the power control and channel assignment problem in device-to-device (D2D) communications underlaying a non-or...
7
arXiv:1611.00630v2 [math.ST] 27 Jun 2017 The accumulated persistence function, a new useful functional summary statistic for topological data analysis, with a view to brain artery trees and spatial point process applications Christophe A.N. Biscio Department of Mathematical Sciences, Aalborg University, Denmark and Je...
10
Deep Learning Framework for Multi-class Breast Cancer Histology Image Classification arXiv:1802.00931v1 [cs.CV] 3 Feb 2018 Yeeleng S. Vang, Zhen Chen, and Xiaohui Xie University of California Irvine Irvine, CA 92697 {ysvang, zhenc4}@uci.edu xhx@ics.uci.edu Abstract. In this work, we present a deep learning framework...
1
Semantic Segmentation of Colon Glands with Deep Convolutional Neural Networks and Total Variation Segmentation Philipp Kainz1,2,* , Michael Pfeiffer2 , and Martin Urschler3,4,5 arXiv:1511.06919v2 [cs.CV] 10 Oct 2017 1 Institute of Biophysics, Center for Physiological Medicine, Medical University of Graz, Graz, Austr...
1
1 A Novel Progressive Learning Technique for Multi-class Classification Rajasekar Venkatesan* 1 and Meng Joo Er2 1, 2 School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore. Email id: RAJA0046@e.ntu.edu.sg 1 EMJER@ntu.edu.sg 2 Abstract— In this paper, a progressive learning tech...
9
Measure of combined effects of morphological parameters of inclusions within composite materials via stochastic homogenization to determine effective mechanical properties Vladimir Salnikov, Sophie Lemaitre, Daniel Choı̈, and Philippe Karamian-Surville Nicolas Oresme Mathematics Laboratory arXiv:1411.4037v2 [cs.CE] 9 ...
5
DIVERGENCE, UNDISTORTION AND HÖLDER CONTINUOUS COCYCLE SUPERRIGIDITY FOR FULL SHIFTS arXiv:1709.10218v2 [math.DS] 9 Oct 2017 NHAN-PHU CHUNG AND YONGLE JIANG Abstract. In this article, we will prove a full topological version of Popa’s measurable cocycle superrigidity theorem for full shifts [36]. More precisely, we...
4
1 Designing Distributed Fixed-Time Consensus Protocols for Linear Multi-Agent Systems Over Directed Graphs arXiv:1605.07761v2 [cs.SY] 26 May 2016 Yu Zhao, Yongfang Liu, Guanrong Chen Abstract This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with gener...
3
arXiv:1605.08188v2 [cs.LG] 5 Jun 2017 Learning Multivariate Log-concave Distributions Ilias Diakonikolas∗ University of Southern California diakonik@usc.edu Daniel M. Kane† University of California, San Diego dakane@cs.ucsd.edu Alistair Stewart University of Southern California alistais@usc.edu June 7, 2017 Abstrac...
7
Dynamic Algorithms for Graph Coloring Sayan Bhattacharya∗ Deeparnab Chakrabarty† Monika Henzinger‡ arXiv:1711.04355v1 [cs.DS] 12 Nov 2017 Danupon Nanongkai§ Abstract We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, th...
8
Program Transformation to Identify List-Based Parallel Skeletons Venkatesh Kannan G. W. Hamilton School of Computing, Dublin City University, Ireland {vkannan, hamilton}@computing.dcu.ie Algorithmic skeletons are used as building-blocks to ease the task of parallel programming by abstracting the details of parallel ...
6
Programming Not Only by Example Hila Peleg Sharon Shoham Eran Yahav Technion hilap@cs.technion.ac.il Tel Aviv University sharon.shoham@gmail.com Technion yahave@cs.technion.ac.il arXiv:1710.01291v1 [cs.PL] 3 Oct 2017 Abstract In recent years, there has been tremendous progress in automated synthesis techniques t...
6
On Coinductive Equivalences for Higher-Order Probabilistic Functional Programs Ugo Dal Lago Davide Sangiorgi Michele Alberti arXiv:1311.1722v1 [cs.PL] 7 Nov 2013 Abstract We study bisimulation and context equivalence in a probabilistic λ-calculus. The contributions of this paper are threefold. Firstly we show a tec...
6
An Empirical Study of AI Population Dynamics with Million-agent Reinforcement Learning Yaodong Yang†⇤ , Lantao Yu‡⇤ , Yiwei Bai‡⇤ , Jun Wang† , Weinan Zhang‡ , Ying Wen† , Yong Yu‡ arXiv:1709.04511v3 [cs.AI] 5 Oct 2017 † University College London, ‡ Shanghai Jiao Tong University Abstract In this paper, we conduct a...
2
Zeros of irreducible characters in factorised groups arXiv:1803.00432v1 [math.GR] 1 Mar 2018 M. J. Felipe · A. Martı́nez-Pastor · V. M. Ortiz-Sotomayor ∗ Abstract An element g of a finite group G is said to be vanishing in G if there exists an irreducible character χ of G such that χ(g) = 0; in this case, g is also...
4
arXiv:1511.00822v1 [math.CV] 3 Nov 2015 SOME CURIOSITIES OF THE ALGEBRA OF BOUNDED DIRICHLET SERIES RAYMOND MORTINI AND AMOL SASANE Abstract. It is shown that the algebra H ∞ of bounded Dirichlet series is not a coherent ring, and has infinite Bass stable rank. As corollaries of the latter result, it is derived that H...
0
Vanishing ideals of binary Hamming spheres arXiv:1802.02875v1 [math.AC] 8 Feb 2018 Alessio Meneghetti University of Trento, Department of Mathematics, Trento, Italy Abstract We show how to efficiently obtain the Algebraic Normal Form of Boolean functions vanishing on Hamming spheres centred at zero. By exploiting th...
0
The reinterpretation of standard deviation concept Ye xiaoming1,2 1 School of Geodesy and Geomatics, Wuhan University, Wuhan, Hubei, China, 430079. Key Laboratory of Precision Engineering & Industry Surveying, State Bureau of Surveying and Mapping, Wuhan, Hubei, China, 430079 2 Abstract: Existing mathematical theory...
10
A Distributional Representation Model For Collaborative Filtering Zhang Junlin,Cai Heng ,Huang Tongwen, Xue Huiping Chanjet.com {zhangjlh,caiheng,huangtw,xuehp}@chanjet.com Abstract In this paper, we propose a very concise deep learning approach for collaborative filtering that jointly models distributional representa...
9
arXiv:1803.03622v1 [cs.NI] 9 Mar 2018 Virtual Network Embedding Approximations: Leveraging Randomized Rounding Matthias Rost Stefan Schmid TU Berlin, Germany Email: mrost@inet.tu-berlin.de University of Vienna, Austria Email: stefan schmid@univie.ac.at Abstract—The Virtual Network Embedding Problem (VNEP) captures...
8
THE SQUARING OPERATION FOR COMMUTATIVE DG RINGS arXiv:1412.4229v4 [math.KT] 24 Oct 2015 AMNON YEKUTIELI Abstract. Let A → B be a homomorphism of commutative rings. The squaring operation is a functor SqB/A from the derived category D(B) of complexes of B-modules into itself. This operation is needed for the definitio...
0
A Popperian Falsification of AI - Lighthill’s Argument Defended Steven Meyer smeyer@tdl.com February 15, 2017 Abstract The area of computation called artificial intelligence (AI) is falsified by describing a previous 1972 falsification of AI by British applied mathematician James Lighthill. It is explained how Lighth...
2
MIS in the Congested Clique Model in O(log log ∆) Rounds⋆ Christian Konrad arXiv:1802.07647v1 [cs.DC] 21 Feb 2018 Department of Computer Science, Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, UK, c.konrad@warwick.ac.uk Abstract. We give a maximal independent set (MIS)...
8
ON MODULES WITH SELF TOR VANISHING arXiv:1803.09233v1 [math.AC] 25 Mar 2018 OLGUR CELIKBAS AND HENRIK HOLM A BSTRACT. The long-standing Auslander and Reiten Conjecture states that a finitely generated module M over a finite-dimensional algebra A with ExtAi (M, M) = ExtAi (M, A) = 0 for all i > 0 must be projective. I...
0
arXiv:1412.6161v2 [cs.SY] 19 Oct 2017 GRAPH-BASED DWELL TIME COMPUTATION METHODS FOR DISCRETE-TIME SWITCHED LINEAR SYSTEMS F. İlhan and Ö. Karabacak 12 September 2015 Abstract Analytical computation methods are proposed for evaluating the minimum dwell time and average dwell time guaranteeing the asymptotic stabilit...
3
Modified Soft Brood Crossover in Genetic Programming Hardik M. Parekh Vipul K. Dabhi Information Technology Department Dharmsinh Desai University Nadiad, India hrdk018@gmail.com Information Technology Department Dharmsinh Desai University Nadiad, India vipul.k.dabhi@gmail.com Abstract – Premature convergence is one...
9
arXiv:1706.08708v1 [cs.IT] 27 Jun 2017 Minimum BER Precoding in 1-Bit Massive MIMO Systems Hela Jedda and Josef A. Nossek Amine Mezghani Institute of Circuit Theory and Signal Processing Technische Universität München, 80290 Munich Germany Email: {hela.jedda, josef.a.nossek}@tum.de University of California, Irvin...
7
1 A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem Jun He, Boris Mitavskiy and Yuren Zhou arXiv:1404.3520v1 [cs.NE] 14 Apr 2014 Abstract Evolutionary algorithms are well suited for solving the knapsack problem. Some empirical studies claim that evolutionary algorithms ...
9
Shafahi, Wang, Haghani 1 SCHOOL BUS ROUTING BY MAXIMIZING TRIP COMPATIBILITY Ali Shafahi PhD Candidate Department of Civil and Environmental Engineering University of Maryland College Park, MD 20742 Email: ashafahi@umd.edu Zhongxiang Wang Graduate Student Department of Civil and Environmental Engineering University o...
2
Statistical Science 2014, Vol. 29, No. 2, 181–200 DOI: 10.1214/13-STS462 c Institute of Mathematical Statistics, 2014 Enhancing R with Advanced Compilation Tools and Methods arXiv:1409.3144v1 [stat.CO] 9 Sep 2014 Duncan Temple Lang Abstract. I describe an approach to compiling common idioms in R code directly to nat...
6
International Journal of Computer Applications (0975 – 8887) Volume 34– No.6, November 2011 An Effective Evolutionary Clustering Algorithm: Hepatitis C case study M. H. Marghny Rasha M. Abd El-Aziz Ahmed I. Taloba Computer Science Department, Faculty of Computer and Information, Assiut University, Egypt. Computer ...
9
Stochastic Interchange Scheduling in the Real-Time Electricity Market arXiv:1601.02191v1 [cs.SY] 10 Jan 2016 Yuting Ji, Tongxin Zheng, Senior Member, IEEE, and Lang Tong, Fellow, IEEE Abstract—The problem of multi-area interchange scheduling in the presence of stochastic generation and load is considered. A new inte...
3
The Parametric Closure Problem David Eppstein arXiv:1504.04073v2 [cs.DS] 12 Sep 2017 Computer Science Department, Univ. of California, Irvine, USA Abstract. We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute ...
8
Polymorphic Type Inference for Machine Code ∗ Matthew Noonan Alexey Loginov David Cok arXiv:1603.05495v2 [cs.PL] 18 Mar 2016 GrammaTech, Inc. Ithaca NY, USA {mnoonan,alexey,dcok}@grammatech.com Abstract For many compiled languages, source-level types are erased very early in the compilation process. As a result, f...
6
All good things come in threes - Three beads learn to swim with lattice Boltzmann and a rigid body solver arXiv:1108.0786v1 [cs.CE] 3 Aug 2011 Kristina Pickla,b,∗, Jan Götza , Klaus Iglbergerc , Jayant Pandeb,d , Klaus Meckeb,c,d , Ana-Sunčana Smithb,c,d , Ulrich Rüdea,b,c a Lehrstuhl für Systemsimulation, Fried...
5
Sample-Optimal Identity Testing with High Probability arXiv:1708.02728v1 [cs.DS] 9 Aug 2017 Ilias Diakonikolas∗ CS, USC diakonik@usc.edu Themis Gouleakis† CSAIL, MIT tgoule@mit.edu John Peebles‡ CSAIL, MIT jpeebles@mit.edu Eric Price CS, UT Austin ecprice@cs.utexas.edu August 10, 2017 Abstract We study the proble...
8
1 Large System Analysis of Power Normalization Techniques in Massive MIMO arXiv:1705.07183v1 [cs.IT] 19 May 2017 Meysam Sadeghi, Student Member, IEEE, Luca Sanguinetti, Senior Member, IEEE, Romain Couillet, Senior Member, IEEE, and Chau Yuen, Senior Member, IEEE Abstract—Linear precoding has been widely studied in ...
7
arXiv:1505.06607v2 [cs.CE] 26 May 2015 arXiv: some other text goes here Stochastic Block Coordinate Frank-Wolfe Algorithm for Large-Scale Biological Network Alignment 1 Yijie Wang1 and Xiaoning Qian1 Department of Electrical & Computer Engineering, Texas A&M University, College Station, Texas, USA, 77843 (Dated: May ...
5
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting arXiv:1712.02176v1 [cs.DM] 6 Dec 2017 Alfonso Cevallos* Stefan Weltge† Rico Zenklusen‡ December 7, 2017 Abstract Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and...
8
Creating modular and reusable DSL textual syntax definitions with Grammatic/ANTLR arXiv:0902.2621v1 [cs.PL] 16 Feb 2009 Andrey Breslav St. Petersburg State University of Information Technology, Mechanics and Optics abreslav@gmail.com Abstract. In this paper we present Grammatic – a tool for textual syntax definition...
6
arXiv:1308.3071v2 [math.AC] 25 Aug 2015 SOME DUALITY AND EQUIVALENCE RESULTS MAJID RAHRO ZARGAR Abstract. Let (R, m) be a relative Cohen-Macaulay local ring with respect to an ideal a of R and set c := ht a. In this paper, we investigate some properties of the Matlis dual Hca (R)∨ of the R-module Hca (R) and we show ...
0
The information and its observer: external and internal information processes, information cooperation, and the origin of the observer intellect Vladimir S. Lerner, USA, lernervs@gmail.com In observing interactive processes, conversion of observed uncertainty to observer certainty is natural phenomenon creating Yes-No ...
7
A Calculus for Modeling Floating Authorizations Jovanka Pantović1 , Ivan Prokić1 , and Hugo Torres Vieira2 1 Faculty of Technical Sciences, University of Novi Sad, Serbia 2 IMT School for Advanced Studies Lucca, Lucca, Italy arXiv:1802.05863v1 [cs.PL] 16 Feb 2018 Abstract Controlling resource usage in distributed ...
6
GROWTH OF PERIODIC GRIGORCHUK GROUPS arXiv:1802.09077v1 [math.GR] 25 Feb 2018 ANNA ERSCHLER AND TIANYI ZHENG A BSTRACT. On torsion Grigorchuk groups we construct random walks of finite entropy and power-law tail decay with non-trivial Poisson boundary. Such random walks provide near optimal volume lower estimates fo...
4
This manuscript is the pre-submission manuscript provided by the authors. For the final, post-review version, please see: http://dx.doi.org/10.1038/nature14422 Robots that can adapt like animals arXiv:1407.3501v4 [cs.RO] 27 May 2015 Antoine Cully,1,2 Jeff Clune,6 Danesh Tarapore,1,2 Jean-Baptiste Mouret1−5,∗ As robo...
9
arXiv:1707.09561v1 [stat.ME] 29 Jul 2017 Fine-Gray Competing Risks Model with High-Dimensional Covariates: Estimation and Inference Jue Hou1 , Jelena Bradic1 and Ronghui Xu1,2 1 Department of Mathematics, 2 Department of Family Medicine and Public Health, University of California San Diego, CA 92093 Abstract The purp...
10
Survey of Visual Question Answering: Datasets and Techniques Akshay Kumar Gupta Indian Institute of Technology Delhi cs5130275@cse.iitd.ac.in arXiv:1705.03865v2 [cs.CL] 11 May 2017 Abstract Visual question answering (or VQA) is a new and exciting problem that combines natural language processing and computer vision ...
2
TextureGAN: Controlling Deep Image Synthesis with Texture Patches Wenqi Xian †1 Patsorn Sangkloy †1 Varun Agrawal 1 Amit Raj 1 Jingwan Lu 2 Chen Fang 2 Fisher Yu 3 James Hays 1 arXiv:1706.02823v2 [cs.CV] 23 Dec 2017 1 2 Georgia Institute of Technology Adobe Research 3 UC Berkeley Figure 1. With TextureGAN, one ...
1
arXiv:1702.08895v1 [math.ST] 28 Feb 2017 Minimax density estimation for growing dimension Daniel J. McDonald Department of Statistics Indiana University Bloomington, IN, 47405 dajmcdon@indiana.edu Version: March 1, 2017 Abstract This paper presents minimax rates for density estimation when the data dimension d is allo...
10
Forward Link Interference Mitigation in Mobile Interactive Satellite Systems ∗ arXiv:1803.07335v1 [eess.SP] 20 Mar 2018 P. Henarejos, M. A. Vázquez † ‡ and G. Cocco Centre Tecnològic de Telecomunicacions de Catalunya, 08860 Castelldefels, Barcelona, Spain A. Pérez-Neira § Universitat Politècnica de Catalunya,...
7
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes⋆ Konrad K. Dabrowski1, Vadim V. Lozin2 , and Daniël Paulusma1 arXiv:1711.08837v1 [math.CO] 23 Nov 2017 1 Department of Computer Science, Durham University, Lower Mountjoy, South Road, Durham DH1 3LE, United Kingdom {konrad.dabrowski,daniel.paulusma}...
8
NUMERICAL IMPLICITIZATION FOR MACAULAY2 arXiv:1610.03034v1 [math.AG] 10 Oct 2016 JUSTIN CHEN AND JOE KILEEL Abstract. We present the Macaulay2 package NumericalImplicitization, which allows for user-friendly computation of the basic invariants of the image of a polynomial map, such as dimension, degree, and Hilbert f...
0
ON THE COHEN-MACAULAYNESS OF TANGENT CONES OF MONOMIAL CURVES IN A4 (K) arXiv:1512.04204v4 [math.AC] 3 Feb 2017 FEZA ARSLAN, ANARGYROS KATSABEKIS, AND MELISSA NALBANDIYAN Abstract. In this paper we give necessary and sufficient conditions for the Cohen-Macaulayness of the tangent cone of a monomial curve in the 4-dim...
0
Question Asking as Program Generation Anselm Rothe1 anselm@nyu.edu arXiv:1711.06351v1 [cs.CL] 16 Nov 2017 1 Brenden M. Lake1,2 brenden@nyu.edu Todd M. Gureckis1 todd.gureckis@nyu.edu 2 Department of Psychology Center for Data Science New York University Abstract A hallmark of human intelligence is the ability to...
2
Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem ∗ Tetsunao Matsuta† arXiv:1802.07458v1 [cs.IT] 21 Feb 2018 source symbol X encoder 1 ✲ f1 encoder 2 ✲ f2 decoder 1 ✲ ϕ1 reprod. symbol 1 decoder 2 reprod. symbol 2 ✲ϕ ✲ 2 Tomohiko Uyematsu‡ rate-di...
7
1 Training and Testing Object Detectors with Virtual Images arXiv:1712.08470v1 [cs.CV] 22 Dec 2017 Yonglin Tian, Xuan Li, Kunfeng Wang, Member, IEEE, and Fei-Yue Wang, Fellow, IEEE Abstract—In the area of computer vision, deep learning has produced a variety of state-of-the-art models that rely on massive labeled d...
1
arXiv:1712.05513v1 [cs.LO] 15 Dec 2017 A Decidable Fragment of Second Order Logic With Applications to Synthesis P. Madhusudan, Umang Mathur, Shambwaditya Saha, and Mahesh Viswanathan University of Illinois, Urbana Champaign, USA Abstract. We propose a fragment of many-sorted second order logic ESMT and show that che...
6
arXiv:1712.02475v1 [math.GR] 7 Dec 2017 SANDWICH STRUCTURES FROM ARBITRARY FUNCTIONS IN GROUP THEORY IAN HAWTHORN Abstract. Functions between groups with the property that all function conjugates are inverse preserving are called sandwich morphisms. These maps preserve a structure within the group known as the sandwic...
4
ON IDEALS GENERATED BY TWO GENERIC QUADRATIC FORMS IN THE EXTERIOR ALGEBRA arXiv:1803.08918v1 [math.AC] 23 Mar 2018 VERONICA CRISPIN QUIÑONEZ, SAMUEL LUNDQVIST, AND GLEB NENASHEV Abstract. Based on the structure theory of pairs of skew-symmetric matrices, we give a conjecture for the Hilbert series of the exterior ...
0
The Annals of Probability 2016, Vol. 44, No. 4, 2858–2888 DOI: 10.1214/15-AOP1036 c Institute of Mathematical Statistics, 2016 arXiv:1409.3905v2 [math.PR] 2 Sep 2016 HAFNIANS, PERFECT MATCHINGS AND GAUSSIAN MATRICES By Mark Rudelson∗,1, Alex Samorodnitsky†,2 and Ofer Zeitouni‡,§,3 University of Michigan∗ , Hebrew Uni...
8
Jammali et al. RESEARCH Aligning coding sequences with frameshift extension penalties arXiv:1610.08809v2 [cs.DS] 13 Apr 2017 Safa Jammali1* , Esaie Kuitche1 , Ayoub Rachati1 , François Bélanger1 , Michelle Scott2 and Aı̈da Ouangraoua1 * Correspondence: safa.jammali@USherbrooke.ca 1 Département d’informatique, Fa...
8
Cautious NMPC with Gaussian Process Dynamics for Miniature Race Cars arXiv:1711.06586v1 [cs.SY] 17 Nov 2017 Lukas Hewing1 , Alexander Liniger2 and Melanie N. Zeilinger1 Abstract— This paper presents an adaptive high performance control method for autonomous miniature race cars. Racing dynamics are notoriously hard to...
3
1 A Framework for Rate Efficient Control of Distributed Discrete Systems arXiv:1704.08931v1 [cs.IT] 28 Apr 2017 Jie Ren, Solmaz Torabi, John MacLaren Walsh Abstract—A key issue in the control of distributed discrete systems modeled as Markov decisions processes, is that often the state of the system is not directly...
3
arXiv:1612.02349v1 [math.GR] 7 Dec 2016 On the supersoluble residual of mutually permutable products V. S. Monakhov January 23, 2018 Abstract We prove that if a group G = AB is the mutually permutable product of the supersoluble subgroups A and B, then the supersoluble residual of G coincides with the nilpotent residu...
4
JORDAN PROPERTY FOR NON-LINEAR ALGEBRAIC GROUPS AND PROJECTIVE VARIETIES arXiv:1507.02230v2 [math.AG] 19 Feb 2017 SHENG MENG, DE-QI ZHANG Abstract. A century ago, Camille Jordan proved that the complex general linear group GLn (C) has the Jordan property: there is a Jordan constant Cn such that every finite subgroup ...
4
Applications of Graded Methods to arXiv:1803.02341v1 [math.RT] 6 Mar 2018 Cluster Variables in Arbitrary Types Thomas Booker-Price A thesis submitted for the degree of Doctor of Philosophy Department of Mathematics and Statistics Lancaster University June 2017 Applications of Graded Methods to Cluster Variables in...
0
arXiv:1708.06219v1 [cs.NE] 21 Aug 2017 ON THE APPROXIMATION BY SINGLE HIDDEN LAYER FEEDFORWARD NEURAL NETWORKS WITH FIXED WEIGHTS NAMIG J. GULIYEV AND VUGAR E. ISMAILOV Abstract. Feedforward neural networks have wide applicability in various disciplines of science due to their universal approximation property. Some a...
7
Robust Specification Mining from Demonstrations Marcell Vazquez-Chanlatte1 , Susmit Jha2 , Ashish Tiwari2 , and Sanjit A. Seshia1 arXiv:1710.03875v2 [cs.LG] 14 Feb 2018 1 University of California, Berkeley {marcell.vc,sseshia}@eecs.berkeley.edu 2 SRI International, Menlo Park, {jha,tiwari}@csl.sri.com Abstract. We ...
2
Improved stochastic trace estimation using mutually unbiased bases J. K. Fitzsimons,1 M. A. Osborne,1 S. J. Roberts,1 and J. F. Fitzsimons2, 3 1 Department of Engineering Science, University of Oxford 2 Engineering Product Development, Singapore University of Technology 3 Centre and Design for Quantum Technologies, Na...
8
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution Daniyar Itegulov1 , John Slaney2 , and Bruno Woltzenlogel Paleo2 ? arXiv:1704.03275v2 [cs.LO] 31 Oct 2017 1 2 ITMO University, St. Petersburg, Russia ditegulov@gmail.com Australian National University, Canberra, Australia john.slaney@anu.edu.au bruno.wp@...
2
Markov Decision Processes with Continuous Side Information Aditya Modi admodi@umich.edu Computer Science and Engineering, Univ. of Michigan Ann Arbor arXiv:1711.05726v1 [stat.ML] 15 Nov 2017 Nan Jiang nanjiang@umich.edu Microsoft Research, New York Satinder Singh baveja@umich.edu Computer Science and Engineeri...
2
Robust Visual SLAM with Point and Line Features arXiv:1711.08654v1 [cs.CV] 23 Nov 2017 Xingxing Zuo1 , Xiaojia Xie1 , Yong Liu1,2 and Guoquan Huang3 Abstract— In this paper, we develop a robust efficient visual SLAM system that utilizes heterogeneous point and line features. By leveraging ORB-SLAM [1], the proposed ...
1
Nonparametric Regression with Adaptive Truncation via a Convex Hierarchical Penalty Asad Haris∗, Ali Shojaie†, and Noah Simon‡ University of Washington arXiv:1611.09972v2 [stat.ME] 1 Dec 2016 January 14, 2018 Abstract We consider the problem of non-parametric regression with a potentially large number of covariates....
10
(version 17 March 2015) How the Symbol Grounding of Living Organisms Can Be Realized in Artificial Agents J. H. van Hateren J.H.VAN.HATEREN@RUG.NL Johann Bernouilli Institute for Mathematics and Computer Science University of Groningen, P.O. Box 407, 9700 AK Groningen, The Netherlands Abstract A system with artific...
9
Modularizing and Specifying Protocols among Threads Sung-Shik T.Q. Jongmans Farhad Arbab Centrum Wiskunde & Informatica (CWI) Amsterdam, the Netherlands jongmans@cwi.nl Centrum Wiskunde & Informatica (CWI) Amsterdam, the Netherlands farhad.arbab@cwi.nl We identify three problems with current techniques for implemen...
6
A Greedy Blind Calibration Method for Compressed Sensing with Unknown Sensor Gains Valerio Cambareri, Amirafshar Moshtaghpour, Laurent Jacques arXiv:1610.02851v3 [cs.IT] 20 Feb 2018 Image and Signal Processing Group, ICTEAM/ELEN, Université catholique de Louvain, Louvain-la-Neuve, Belgium. E-mail: {valerio.cambareri...
7
Data-Efficient Reinforcement Learning with Probabilistic Model Predictive Control arXiv:1706.06491v2 [cs.SY] 22 Feb 2018 Sanket Kamthe Department of Computing Imperial College London Abstract Trial-and-error based reinforcement learning (RL) has seen rapid advancements in recent times, especially with the advent of ...
3
The MacGyver Test - A Framework for Evaluating Machine Resourcefulness and Creative Problem Solving arXiv:1704.08350v1 [cs.AI] 26 Apr 2017 Vasanth Sarathy Matthias Scheutz Tufts University Medford, MA, USA Abstract Current measures of machine intelligence are either difficult to evaluate or lack the ability to test ...
2
Synthesizing Dynamic Patterns by Spatial-Temporal Generative ConvNet Jianwen Xie, Song-Chun Zhu, and Ying Nian Wu University of California, Los Angeles (UCLA), USA arXiv:1606.00972v2 [stat.ML] 29 May 2017 jianwen@ucla.edu, sczhu@stat.ucla.edu, ywu@stat.ucla.edu Abstract models that can be used for unsupervised lear...
9
Canonical embedded and non-embedded resolution of singularities for excellent two-dimensional schemes arXiv:0905.2191v2 [math.AG] 18 Feb 2013 Vincent Cossart and Uwe Jannsen and Shuji Saito 18th February 2013 0 Introduction 3 1 Basic invariants for singularities 12 2 Permissible blow-ups 30 3 B-Permissible blow...
0
arXiv:1703.01909v1 [cs.NE] 6 Mar 2017 Neuromorphic Hardware In The Loop: Training a Deep Spiking Network on the BrainScaleS Wafer-Scale System Sebastian Schmitt† Johann Klähn† Guillaume Bellec§ Andreas Grübl† Maurice Güttler† Andreas Hartel† Stephan Hartmann‡ Dan Husmann† Kai Husmann† Sebastian Jeltsch† Vitali Karasen...
9
arXiv:1508.00371v3 [math.GR] 24 Aug 2016 Zeta functions of finite Schreier graphs and their zig zag products Asif Shaikh, Hemant Bhate Abstract We investigate the Ihara zeta functions of finite Schreier graphs Γn of the Basilica group. We show that Γ1+n is 2 sheeted unramified normal covering Z . In fact, for any n > ...
4
On Sound Relative Error Bounds for Floating-Point Arithmetic Anastasiia Izycheva and Eva Darulova arXiv:1707.02121v2 [cs.PL] 4 Aug 2017 Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany Email: izycheva@mpi-sws.org, eva@mpi-sws.org Abstract—State-of-the-art static analysis tools for veri...
6
arXiv:1503.05743v1 [cs.DC] 19 Mar 2015 Implementation of a Practical Distributed Calculation System with Browsers and JavaScript, and Application to Distributed Deep Learning Ken Miura MIURA @ MI . T. U - TOKYO . AC . JP Tatsuya Harada HARADA @ MI . T. U - TOKYO . AC . JP Machine Intelligence Laboratory, Department o...
9
Cost-Aware Automatic Program Repair Roopsha Samanta1 , Oswaldo Olivo2 , and E. Allen Emerson2 arXiv:1307.7281v2 [cs.PL] 31 Mar 2014 1 The University of Texas at Austin and IST Austria roopsha@ist.ac.at 2 The University of Texas at Austin {olivo,emerson}@cs.utexas.edu Abstract. We present a formal framework for repa...
6
Learning Complex Swarm Behaviors by Exploiting Local Communication Protocols with Deep Reinforcement Learning arXiv:1709.07224v1 [cs.MA] 21 Sep 2017 Maximilian Hüttenrauch1 and Adrian Šošić2 and Gerhard Neumann1 Abstract— Swarm systems constitute a challenging problem for reinforcement learning (RL) as the algorithm...
2
TRUTH VALIDATION WITH EVIDENCE Papis Wongchaisuwat and Diego Klabjan Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL Abstract In the modern era, abundant information is easily accessible from various sources, however only a few of these sources are reliable as they mo...
2
arXiv:1310.2315v1 [math.AC] 9 Oct 2013 REGULAR CW-COMPLEXES AND POSET RESOLUTIONS OF MONOMIAL IDEALS TIMOTHY B.P. CLARK AND ALEXANDRE TCHERNEV Abstract. We use the natural homeomorphism between a regular CW-complex X and its face poset PX to establish a canonical isomorphism between the cellular chain complex of X an...
0
Finding small-width connected path decompositions in polynomial time Dariusz Dereniowski∗ Dorota Osula∗ Paweł Rzążewski† arXiv:1802.05501v1 [cs.DS] 15 Feb 2018 Abstract A connected path decomposition of a simple graph G is a path decomposition (X1 , . . . , Xl ) such that the subgraph of G induced by X1 ∪ · · · ∪ X...
8
arXiv:1602.01132v3 [stat.ML] 16 Jun 2016 Interactive Algorithms: from Pool to Stream Sivan Sabato and Tom Hess Department of Computer Science Ben-Gurion University of the Negev Abstract We consider interactive algorithms in the pool-based setting, and in the streambased setting. Interactive algorithms observe suggeste...
10
ON THE PRIME GRAPH QUESTION FOR INTEGRAL GROUP RINGS OF 4-PRIMARY GROUPS I arXiv:1601.05689v3 [math.RT] 9 Nov 2017 ANDREAS BÄCHLE AND LEO MARGOLIS Abstract. We study the Prime Graph Question for integral group rings. This question can be reduced to almost simple groups by a result of Kimmerle and Konovalov. We prove...
4
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences Yuxin Chen ∗† Emmanuel J. Candès ∗‡ arXiv:1609.05820v3 [cs.IT] 7 Dec 2017 September 2016; Revised November 2016 Abstract Various applications involve assigning discrete label values to a collection of objects based on...
7
This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible Dendritic-Inspired Processing Enables BioPlausible STDP in Compound Binary Synapses Xinyu Wu, Student Member, IEEE and Vishal Saxena, Member, IEEE Abstrac...
9
ON THE CLASSIFYING SPACE OF ARTIN MONOIDS arXiv:1511.02062v2 [math.AT] 20 Feb 2016 GIOVANNI PAOLINI Abstract. A theorem proved by Dobrinskaya in 2006 shows that there is a strong connection between the K(π, 1) conjecture for Artin groups and the classifying space of Artin monoids. More recently Ozornova obtained a d...
4
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Traffic Sign Timely Visual Recognizability Evaluation Based on 3D Measurable Point Clouds arXiv:1710.03553v1 [cs.CV] 10 Oct 2017 Shanxin Zhang, Cheng Wang, Senior Member, IEEE, Zhuang Yang, Member, IEEE, Chenglu Wen, Member, IEEE, Jonathan Li, Senior Membe...
1
Dropping Activation Outputs with Localized First-layer Deep Network for Enhancing User Privacy and Data Security Hao Dong, Chao Wu, Zhen Wei, Yike Guo arXiv:1711.07520v1 [cs.CV] 20 Nov 2017 Department of Computing, Imperial College London {hao.dong11, chao.wu, zhen.wei11, y.guo}@imperial.ac.uk Abstract—Deep learning ...
1
Programmable Restoration Granularity in Constraint Programming Yong Lin and Martin Henz arXiv:1601.06517v2 [cs.PL] 4 Feb 2016 School of Computing, National University of Singapore, Singapore {linyong, henz}@comp.nus.edu.sg Abstract. In most constraint programming systems, a limited number of search engines is offere...
6
Exploring Spatial Context for 3D Semantic Segmentation of Point Clouds Francis Engelmann† , Theodora Kontogianni† , Alexander Hermans and Bastian Leibe Computer Vision Group, Visual Computing Institute RWTH Aachen University arXiv:1802.01500v1 [cs.CV] 5 Feb 2018 {engelmann,kontogianni,hermans,leibe}@vision.rwth-aache...
1
arXiv:1505.01034v2 [math.OC] 12 Apr 2016 A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding ⋆ Alessio Benavoli a , Dario Piga b , a b IDSIA Dalle Molle Institute for Artificial Intelligence SUPSI-USI, Manno, Switzerland. IMT Institute for Advanced...
3