text
null | inputs
dict | prediction
null | prediction_agent
null | annotation
list | annotation_agent
null | multi_label
bool 1
class | explanation
null | id
stringlengths 1
5
| metadata
null | status
stringclasses 2
values | event_timestamp
null | metrics
null |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
null |
{
"abstract": " Given an ideal $\\mathcal{I}$ on $\\omega$, we show that a sequence in a\ntopological space $X$ is $\\mathcal{I}$-convergent if and only if there exists a\n\"big\" $\\mathcal{I}$-convergent subsequence. In addition, we study several\nproperties of $\\mathcal{I}$-cluster points. As a consequence, the underlying\ntopology $\\tau$ coincides with the topology generated by the pair\n$(\\tau,\\mathcal{I})$. Then, we obtain two characterizations of the set of\n$\\mathcal{I}$-cluster points as classical cluster points of a filters on $X$\nand as the smallest closed set containing \"almost all\" the sequence.\n",
"title": "Ideal Cluster Points in Topological Spaces"
}
| null | null | null | null | true | null |
17101
| null |
Default
| null | null |
null |
{
"abstract": " Gravitons possess a Berry curvature due to their helicity. We derive the\nsemiclassical equations of motion for gravitons taking into account the Berry\ncurvature. We show that this quantum correction leads to the splitting of the\ntrajectories of right- and left-handed gravitational waves in curved space, and\nthat this correction can be understood as a topological phenomenon. This is the\nspin Hall effect (SHE) of gravitational waves. We find that the SHE of\ngravitational waves is twice as large as that of light. Possible future\nobservations of the SHE of gravitational waves can potentially test the quantum\nnature of gravitons beyond the classical general relativity.\n",
"title": "Spin Hall effect of gravitational waves"
}
| null | null | null | null | true | null |
17102
| null |
Default
| null | null |
null |
{
"abstract": " All-goals updating exploits the off-policy nature of Q-learning to update all\npossible goals an agent could have from each transition in the world, and was\nintroduced into Reinforcement Learning (RL) by Kaelbling (1993). In prior work\nthis was mostly explored in small-state RL problems that allowed tabular\nrepresentations and where all possible goals could be explicitly enumerated and\nlearned separately. In this paper we empirically explore 3 different extensions\nof the idea of updating many (instead of all) goals in the context of RL with\ndeep neural networks (or DeepRL for short). First, in a direct adaptation of\nKaelbling's approach we explore if many-goals updating can be used to achieve\nmastery in non-tabular visual-observation domains. Second, we explore whether\nmany-goals updating can be used to pre-train a network to subsequently learn\nfaster and better on a single main task of interest. Third, we explore whether\nmany-goals updating can be used to provide auxiliary task updates in training a\nnetwork to learn faster and better on a single main task of interest. We\nprovide comparisons to baselines for each of the 3 extensions.\n",
"title": "Many-Goals Reinforcement Learning"
}
| null | null | null | null | true | null |
17103
| null |
Default
| null | null |
null |
{
"abstract": " Key to structured prediction is exploiting the problem structure to simplify\nthe learning process. A major challenge arises when data exhibit a local\nstructure (e.g., are made by \"parts\") that can be leveraged to better\napproximate the relation between (parts of) the input and (parts of) the\noutput. Recent literature on signal processing, and in particular computer\nvision, has shown that capturing these aspects is indeed essential to achieve\nstate-of-the-art performance. While such algorithms are typically derived on a\ncase-by-case basis, in this work we propose the first theoretical framework to\ndeal with part-based data from a general perspective. We derive a novel\napproach to deal with these problems and study its generalization properties\nwithin the setting of statistical learning theory. Our analysis is novel in\nthat it explicitly quantifies the benefits of leveraging the part-based\nstructure of the problem with respect to the learning rates of the proposed\nestimator.\n",
"title": "Localized Structured Prediction"
}
| null | null | null | null | true | null |
17104
| null |
Default
| null | null |
null |
{
"abstract": " Nanocommunications, understood as communications between nanoscale devices,\nis commonly regarded as a technology essential for cooperation of large groups\nof nanomachines and thus crucial for development of the whole area of\nnanotechnology. While solutions for point-to-point nanocommunications have been\nalready proposed, larger networks cannot function properly without routing. In\nthis article we focus on the nanocommunications via Forster Resonance Energy\nTransfer (FRET), which was found to be a technique with a very high signal\npropagation speed, and discuss how to route signals through nanonetworks. We\nintroduce five new routing mechanisms, based on biological properties of\nspecific molecules. We experimentally validate one of these mechanisms.\nFinally, we analyze open issues showing the technical challenges for signal\ntransmission and routing in FRET-based nanocommunications.\n",
"title": "Routing in FRET-based Nanonetworks"
}
| null | null | null | null | true | null |
17105
| null |
Default
| null | null |
null |
{
"abstract": " Winograd-based convolution has quickly gained traction as a preferred\napproach to implement convolutional neural networks (ConvNet) on various\nhardware platforms because it requires fewer floating point operations than\nFFT-based or direct convolutions.\nThis paper compares three highly optimized implementations (regular FFT--,\nGauss--FFT--, and Winograd--based convolutions) on modern multi-- and\nmany--core CPUs. Although all three implementations employed the same\noptimizations for modern CPUs, our experimental results with two popular\nConvNets (VGG and AlexNet) show that the FFT--based implementations generally\noutperform the Winograd--based approach, contrary to the popular belief.\nTo understand the results, we use a Roofline performance model to analyze the\nthree implementations in detail, by looking at each of their computation phases\nand by considering not only the number of floating point operations, but also\nthe memory bandwidth and the cache sizes. The performance analysis explains\nwhy, and under what conditions, the FFT--based implementations outperform the\nWinograd--based one, on modern CPUs.\n",
"title": "FFT Convolutions are Faster than Winograd on Modern CPUs, Here is Why"
}
| null | null | null | null | true | null |
17106
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we investigate the properties of function spaces using the\nselection principles.\n",
"title": "The application of selection principles in the study of the properties of function spaces"
}
| null | null |
[
"Mathematics"
] | null | true | null |
17107
| null |
Validated
| null | null |
null |
{
"abstract": " We propose a new method for learning the structure of convolutional neural\nnetworks (CNNs) that is more efficient than recent state-of-the-art methods\nbased on reinforcement learning and evolutionary algorithms. Our approach uses\na sequential model-based optimization (SMBO) strategy, in which we search for\nstructures in order of increasing complexity, while simultaneously learning a\nsurrogate model to guide the search through structure space. Direct comparison\nunder the same search space shows that our method is up to 5 times more\nefficient than the RL method of Zoph et al. (2018) in terms of number of models\nevaluated, and 8 times faster in terms of total compute. The structures we\ndiscover in this way achieve state of the art classification accuracies on\nCIFAR-10 and ImageNet.\n",
"title": "Progressive Neural Architecture Search"
}
| null | null | null | null | true | null |
17108
| null |
Default
| null | null |
null |
{
"abstract": " The maximum gap $g(f)$ of a polynomial $f$ is the maximum of the differences\n(gaps) between two consecutive exponents that appear in $f$. Let $\\Phi_{n}$ and\n$\\Psi_{n}$ denote the $n$-th cyclotomic and $n$-th inverse cyclotomic\npolynomial, respectively. In this paper, we give several lower bounds for\n$g(\\Phi_{n})$ and $g(\\Psi_{n})$, where $n$ is the product of odd primes. We\nobserve that they are very often exact. We also give an exact expression for\n$g(\\Psi_{n})$ under a certain condition. Finally we conjecture an exact\nexpression for $g(\\Phi_{n})$ under a certain condition.\n",
"title": "Lower Bounds for Maximum Gap in (Inverse) Cyclotomic Polynomials"
}
| null | null | null | null | true | null |
17109
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we have analyzed the stability of cylindrically symmetric\ncollapsing object filled with locally anisotropic fluid in $f(R,T)$ theory,\nwhere $R$ is the scalar curvature and $T$ is the trace of stress-energy tensor\nof matter. Modified field equations and dynamical equations are constructed in\n$f(R,T)$ gravity. Evolution or collapse equation is derived from dynamical\nequations by performing linear perturbation on them. Instability range is\nexplored in both Newtonian and post-Newtonian regimes with the help of\nadiabetic index, which defines the impact of physical parameters on the\ninstability range. Some conditions are imposed on physical quantities to secure\nthe stability of the gravitating sources.\n",
"title": "Dynamical Analysis of Cylindrically Symmetric Anisotropic Sources in $f(R,T)$ Gravity"
}
| null | null | null | null | true | null |
17110
| null |
Default
| null | null |
null |
{
"abstract": " We present an $\\ell$-adic trace formula for saturated and admissible\ndg-categories over a base monoidal dg-category. Moreover, we prove Künneth\nformulas for dg-category of singularities, and for inertia-invariant vanishing\ncycles. As an application, we prove a version of Bloch's Conductor Conjecture\n(stated by Spencer Bloch in 1985), under the additional hypothesis that the\nmonodromy action of the inertia group is unipotent.\n",
"title": "Trace and Kunneth formulas for singularity categories and applications"
}
| null | null | null | null | true | null |
17111
| null |
Default
| null | null |
null |
{
"abstract": " We present the results from an extensive spectroscopic survey of the central\nregion of the nearby galaxy cluster Abell 2199 at $z=0.03$. By combining 775\nnew redshifts from the MMT/Hectospec observations with the data in the\nliterature, we construct a large sample of 1624 galaxies with measured\nredshifts at $R<30^\\prime$, which results in high spectroscopic completeness at\n$r_{\\rm petro,0}<20.5$ (77%). We use these data to study the kinematics and\nclustering of galaxies focusing on the comparison with those of the\nintracluster medium (ICM) from Suzaku X-ray observations. We identify 406\nmember galaxies of A2199 at $R<30^\\prime$ using the caustic technique. The\nvelocity dispersion profile of cluster members appears smoothly connected to\nthe stellar velocity dispersion profile of the cD galaxy. The luminosity\nfunction is well fitted with a Schechter function at $M_r<-15$. The radial\nvelocities of cluster galaxies generally agree well with those of the ICM, but\nthere are some regions where the velocity difference between the two is about a\nfew hundred kilometer per second. The cluster galaxies show a hint of global\nrotation at $R<5^\\prime$ with $v_{\\rm rot}=300{-}600\\,\\textrm{km s}^{-1}$, but\nthe ICM in the same region do not show such rotation. We apply a\nfriends-of-friends algorithm to the cluster galaxy sample at $R<60^\\prime$ and\nidentify 32 group candidates, and examine the spatial correlation between the\ngalaxy groups and X-ray emission. This extensive survey in the central region\nof A2199 provides an important basis for future studies of interplay among the\ngalaxies, the ICM and the dark matter in the cluster.\n",
"title": "A Redshift Survey of the Nearby Galaxy Cluster Abell 2199: Comparison of the Spatial and Kinematic Distributions of Galaxies with the Intracluster Medium"
}
| null | null | null | null | true | null |
17112
| null |
Default
| null | null |
null |
{
"abstract": " Superconducting bulk (RE)Ba$_2$Cu$_3$O$_{7-x}$ materials (RE-rare earth\nelements) have been successfully used to generate magnetic flux densities in\nexcess of 17 T. This work investigates an alternative approach by trapping flux\nin stacks of second generation high temperature superconducting tape from\nseveral manufacturers using field cooling and pulsed field magnetisation\ntechniques. Flux densities of up to 13.4 T were trapped by field cooling at ~5\nK between two 12 mm square stacks, an improvement of 70% over previous value\nachieved in an HTS tape stack. The trapped flux approaches the record values in\n(RE)BCO bulks and reflects the rapid developments still being made in the HTS\ntape performance.\n",
"title": "A trapped field of 13.4 T in a stack of HTS tapes with 30 μm substrate"
}
| null | null | null | null | true | null |
17113
| null |
Default
| null | null |
null |
{
"abstract": " We exhibit an exact simulation algorithm for the supremum of a stable process\nover a finite time interval using dominated coupling from the past (DCFTP). We\nestablish a novel perpetuity equation for the supremum (via the representation\nof the concave majorants of Lévy processes) and apply it to construct a\nMarkov chain in the DCFTP algorithm. We prove that the number of steps taken\nbackwards in time before the coalescence is detected is finite.\n",
"title": "Exact Simulation of the Extrema of Stable Processes"
}
| null | null | null | null | true | null |
17114
| null |
Default
| null | null |
null |
{
"abstract": " We consider a nonparametric Bayesian approach to estimate the diffusion\ncoefficient of a stochastic differential equation given discrete time\nobservations over a fixed time interval. As a prior on the diffusion\ncoefficient, we employ a histogram-type prior with piecewise constant\nrealisations on bins forming a partition of the time interval. Specifically,\nthese constants are realizations of independent inverse Gamma distributed\nrandoma variables. We justify our approach by deriving the rate at which the\ncorresponding posterior distribution asymptotically concentrates around the\ndata-generating diffusion coefficient. This posterior contraction rate turns\nout to be optimal for estimation of a Hölder-continuous diffusion coefficient\nwith smoothness parameter $0<\\lambda\\leq 1.$ Our approach is straightforward to\nimplement, as the posterior distributions turn out to be inverse Gamma again,\nand leads to good practical results in a wide range of simulation examples.\nFinally, we apply our method on exchange rate data sets.\n",
"title": "Nonparametric Bayesian estimation of a Hölder continuous diffusion coefficient"
}
| null | null | null | null | true | null |
17115
| null |
Default
| null | null |
null |
{
"abstract": " Topological superconductor (TSC) hosting Majorana fermions has been\nestablished as a milestone that may shift our scientific trajectory from\nresearch to applications in topological quantum computing. Recently,\nsuperconducting Pd-Bi binaries have attracted great attention as a possible\nmedium for the TSC phase as a result of their large spin-orbit coupling\nstrength. Here, we report a systematic high-resolution angle-resolved\nphotoemission spectroscopy (ARPES) study on the normal state electronic\nstructure of superconducting alpha-PdBi2 (Tc = 1.7 K). Our results show the\npresence of Dirac states at higher-binding energy with the location of the\nDirac point at 1.26 eV below the chemical potential at the zone center.\nFurthermore, the ARPES data indicate multiple band crossings at the chemical\npotential, consistent with the metallic behavior of alpha-PdBi2. Our detailed\nexperimental studies are complemented by first-principles calculations, which\nreveal the presence of surface Rashba states residing in the vicinity of the\nchemical potential. The obtained results provide an opportunity to investigate\nthe relationship between superconductivity and topology, as well as explore\npathways to possible future platforms for topological quantum computing.\n",
"title": "Dirac State in a Centrosymmetric Superconductor alpha-PdBi2"
}
| null | null | null | null | true | null |
17116
| null |
Default
| null | null |
null |
{
"abstract": " Consider a Henselian rank one valued field $K$ of equicharacteristic zero\nwith the three-sorted language $\\mathcal{L}$ of Denef--Pas. Let $f: A \\to K$ be\na continuous $\\mathcal{L}$-definable (with parameters) function on a closed\nbounded subset $A \\subset K^{n}$. The main purpose is to prove that then $f$ is\nHölder continuous with some exponent $s\\geq 0$ and constant $c \\geq 0$, a\nfortiori, $f$ is uniformly continuous. Further, if $f$ is locally Lipschitz\ncontinuous with a constant $c$, then $f$ is (globally) Lipschitz continuous\nwith possibly some larger constant $d$. Also stated are some problems\nconcerning continuous and Lipschitz continuous functions definable over\nHenselian valued fields.\n",
"title": "Hölder and Lipschitz continuity of functions definable over Henselian rank one valued fields"
}
| null | null | null | null | true | null |
17117
| null |
Default
| null | null |
null |
{
"abstract": " We report the first observation of the magnon-polariton bistability in a\ncavity magnonics system consisting of cavity photons strongly interacting with\nthe magnons in a small yttrium iron garnet (YIG) sphere. The bistable behaviors\nare emerged as sharp frequency switchings of the cavity magnon-polaritons\n(CMPs) and related to the transition between states with large and small number\nof polaritons. In our experiment, we align, respectively, the [100] and [110]\ncrystallographic axes of the YIG sphere parallel to the static magnetic field\nand find very different bistable behaviors (e.g., clockwise and\ncounter-clockwise hysteresis loops) in these two cases. The experimental\nresults are well fitted and explained as being due to the Kerr nonlinearity\nwith either positive or negative coefficient. Moreover, when the magnetic field\nis tuned away from the anticrossing point of CMPs, we observe simultaneous\nbistability of both magnons and cavity photons by applying a drive field on the\nlower branch.\n",
"title": "Bistability of Cavity Magnon Polaritons"
}
| null | null |
[
"Physics"
] | null | true | null |
17118
| null |
Validated
| null | null |
null |
{
"abstract": " Italy adopted a performance-based system for funding universities that is\ncentered on the results of a national research assessment exercise, realized by\na governmental agency (ANVUR). ANVUR evaluated papers by using 'a dual system\nof evaluation', that is by informed peer review or by bibliometrics. In view of\nvalidating that system, ANVUR performed an experiment for estimating the\nagreement between informed review and bibliometrics. Ancaiani et al. (2015)\npresents the main results of the experiment. Baccini and De Nicolao (2017)\ndocumented in a letter, among other critical issues, that the statistical\nanalysis was not realized on a random sample of articles. A reply to the letter\nhas been published by Research Evaluation (Benedetto et al. 2017). This note\nhighlights that in the reply there are (1) errors in data, (2) problems with\n'representativeness' of the sample, (3) unverifiable claims about weights used\nfor calculating kappas, (4) undisclosed averaging procedures; (5) a statement\nabout 'same protocol in all areas' contradicted by official reports. Last but\nnot least: the data used by the authors continue to be undisclosed. A general\nwarning concludes: many recently published papers use data originating from\nItalian research assessment exercise. These data are not accessible to the\nscientific community and consequently these papers are not reproducible. They\ncan be hardly considered as containing sound evidence at least until authors or\nANVUR disclose the data necessary for replication.\n",
"title": "Errors and secret data in the Italian research assessment exercise. A comment to a reply"
}
| null | null | null | null | true | null |
17119
| null |
Default
| null | null |
null |
{
"abstract": " In this study we performed an initial investigation and evaluation of\naltmetrics and their relationship with public policy citation of research\npapers. We examined methods for using altmetrics and other data to predict\nwhether a research paper is cited in public policy and applied receiver\noperating characteristic curve on various feature groups in order to evaluate\ntheir potential usefulness. From the methods we tested, classifying based on\ntweet count provided the best results, achieving an area under the ROC curve of\n0.91.\n",
"title": "Exploring Features for Predicting Policy Citations"
}
| null | null |
[
"Computer Science"
] | null | true | null |
17120
| null |
Validated
| null | null |
null |
{
"abstract": " From a numerical analysis perspective, assessing the robustness of\nl1-minimization is a fundamental issue in compressed sensing and sparse\nregularization. Yet, the recovery guarantees available in the literature\nusually depend on a priori estimates of the noise, which can be very hard to\nobtain in practice, especially when the noise term also includes unknown\ndiscrepancies between the finite model and data. In this work, we study the\nperformance of l1-minimization when these estimates are not available,\nproviding robust recovery guarantees for quadratically constrained basis\npursuit and random sampling in bounded orthonormal systems. Several\napplications of this work are approximation of high-dimensional functions,\ninfinite-dimensional sparse regularization for inverse problems, and fast\nalgorithms for non-Cartesian Magnetic Resonance Imaging.\n",
"title": "Recovery guarantees for compressed sensing with unknown errors"
}
| null | null | null | null | true | null |
17121
| null |
Default
| null | null |
null |
{
"abstract": " This paper defines homology in homotopy type theory, in the process stable\nhomotopy groups are also defined. Previous research in synthetic homotopy\ntheory is relied on, in particular the definition of cohomology. This work lays\nthe foundation for a computer checked construction of homology.\n",
"title": "Synthetic Homology in Homotopy Type Theory"
}
| null | null | null | null | true | null |
17122
| null |
Default
| null | null |
null |
{
"abstract": " We investigate a time-dependent spatial vector-host epidemic model with\nnon-coincident domains for the vector and host populations. The host population\nresides in small non-overlapping sub-regions, while the vector population\nresides throughout a much larger region. The dynamics of the populations are\nmodeled by a reaction-diffusion-advection compartmental system of partial\ndifferential equations. The disease is transmitted through vector and host\npopulations in criss-cross fashion. We establish global well-posedness and\nuniform a prior bounds as well as the long-term behavior. The model is applied\nto simulate the outbreak of bluetongue disease in sheep transmitted by midges\ninfected with bluetongue virus. We show that the long-range directed movement\nof the midge population, due to wind-aided movement, enhances the transmission\nof the disease to sheep in distant sites.\n",
"title": "Spatial Models of Vector-Host Epidemics with Directed Movement of Vectors Over Long Distances"
}
| null | null | null | null | true | null |
17123
| null |
Default
| null | null |
null |
{
"abstract": " Recently, the principal component pursuit has received increasing attention\nin signal processing research ranging from source separation to video\nsurveillance. So far, all existing formulations are real-valued and lack the\nconcept of phase, which is inherent in inputs such as complex spectrograms or\ncolor images. Thus, in this letter, we extend principal component pursuit to\nthe complex and quaternionic cases to account for the missing phase\ninformation. Specifically, we present both complex and quaternionic proximity\noperators for the $\\ell_1$- and trace-norm regularizers. These operators can be\nused in conjunction with proximal minimization methods such as the inexact\naugmented Lagrange multiplier algorithm. The new algorithms are then applied to\nthe singing voice separation problem, which aims to separate the singing voice\nfrom the instrumental accompaniment. Results on the iKala and MSD100 datasets\nconfirmed the usefulness of phase information in principal component pursuit.\n",
"title": "Complex and Quaternionic Principal Component Pursuit and Its Application to Audio Separation"
}
| null | null | null | null | true | null |
17124
| null |
Default
| null | null |
null |
{
"abstract": " Axion-like particles (ALPs) might constitute the totality of the cold dark\nmatter (CDM) observed. The parameter space of ALPs depends on the mass of the\nparticle $m$ and on the energy scale of inflation $H_I$ , the latter being\nbound by the non-detection of primordial gravitational waves. We show that the\nbound on HI implies the existence of a mass scale $m_\\chi = 10 {\\rm \\,neV}\n÷ 0.5 {\\rm \\,peV}$, depending on the ALP susceptibility $\\chi$, such that\nthe energy density of ALPs of mass smaller than $m_\\chi$ is too low to explain\nthe present CDM budget, if the ALP field has originated after the end of\ninflation. This bound affects Ultra-Light Axions (ULAs), which have recently\nregained popularity as CDM candidates. Light ($m < m_\\chi$) ALPs can then be\nCDM candidates only if the ALP field has already originated during the\ninflationary period, in which case the parameter space is constrained by the\nnon-detection of axion isocurvature fluctuations. We comment on the effects on\nthese bounds from additional physics beyond the Standard Model, besides ALPs.\n",
"title": "Light axion-like dark matter must be present during inflation"
}
| null | null | null | null | true | null |
17125
| null |
Default
| null | null |
null |
{
"abstract": " The stochastic knapsack problem is the stochastic variant of the classical\nknapsack problem in which the algorithm designer is given a a knapsack with a\ngiven capacity and a collection of items where each item is associated with a\nprofit and a probability distribution on its size. The goal is to select a\nsubset of items with maximum profit and violate the capacity constraint with\nprobability at most $p$ (referred to as the overflow probability). While\nseveral approximation algorithms have been developed for this problem, most of\nthese algorithms relax the capacity constraint of the knapsack. In this paper,\nwe design efficient approximation schemes for this problem without relaxing the\ncapacity constraint.\n(i) Our first result is in the case when item sizes are Bernoulli random\nvariables. In this case, we design a (nearly) fully polynomial time\napproximation scheme (FPTAS) which only relaxes the overflow probability. (ii)\nOur second result generalizes the first result to the case when all the item\nsizes are supported on a (common) set of constant size. (iii) Our third result\nis in the case when item sizes are so-called \"hypercontractive\" random\nvariables i.e., random variables whose second and fourth moments are within\nconstant factors of each other. In other words, the kurtosis of the random\nvariable is upper bounded by a constant.\nCrucially, all of our algorithms meet the capacity constraint exactly, a\nresult which was previously known only when the item sizes were Poisson or\nGaussian random variables. Our results rely on new connections between Boolean\nfunction analysis and stochastic optimization. We believe that these ideas and\ntechniques may prove to be useful in other stochastic optimization problems as\nwell.\n",
"title": "Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack"
}
| null | null | null | null | true | null |
17126
| null |
Default
| null | null |
null |
{
"abstract": " We study the problem of using i.i.d. samples from an unknown multivariate\nprobability distribution $p$ to estimate the mutual information of $p$. This\nproblem has recently received attention in two settings: (1) where $p$ is\nassumed to be Gaussian and (2) where $p$ is assumed only to lie in a large\nnonparametric smoothness class. Estimators proposed for the Gaussian case\nconverge in high dimensions when the Gaussian assumption holds, but are\nbrittle, failing dramatically when $p$ is not Gaussian. Estimators proposed for\nthe nonparametric case fail to converge with realistic sample sizes except in\nvery low dimensions. As a result, there is a lack of robust mutual information\nestimators for many realistic data. To address this, we propose estimators for\nmutual information when $p$ is assumed to be a nonparanormal (a.k.a., Gaussian\ncopula) model, a semiparametric compromise between Gaussian and nonparametric\nextremes. Using theoretical bounds and experiments, we show these estimators\nstrike a practical balance between robustness and scaling with dimensionality.\n",
"title": "Nonparanormal Information Estimation"
}
| null | null |
[
"Computer Science",
"Mathematics",
"Statistics"
] | null | true | null |
17127
| null |
Validated
| null | null |
null |
{
"abstract": " We introduce a new setting where a population of agents, each modelled by a\nfinite-state system, are controlled uniformly: the controller applies the same\naction to every agent. The framework is largely inspired by the control of a\nbiological system, namely a population of yeasts, where the controller may only\nchange the environment common to all cells. We study a synchronisation problem\nfor such populations: no matter how individual agents react to the actions of\nthe controller, the controller aims at driving all agents synchronously to a\ntarget state. The agents are naturally represented by a non-deterministic\nfinite state automaton (NFA), the same for every agent, and the whole system is\nencoded as a 2-player game. The first player (Controller) chooses actions, and\nthe second player (Agents) resolves non-determinism for each agent. The game\nwith m agents is called the m -population game. This gives rise to a\nparameterized control problem (where control refers to 2 player games), namely\nthe population control problem: can Controller control the m-population game\nfor all m in N whatever Agents does?\n",
"title": "Controlling a population"
}
| null | null | null | null | true | null |
17128
| null |
Default
| null | null |
null |
{
"abstract": " The present work analyzes the distribution function of the finite scale local\nLyapunov exponent of a pair fluid particles trajectories in fully developed\nincompressible homogeneous isotropic turbulence. According to the hypothesis of\nfully developed chaos, this PDF is reasonably estimated by maximizing the\nentropy associated to such distribution, resulting to be an uniform\ndistribution function in a proper interval of variation of the local Lyapunov\nexponents. From this PDF, we determine the relationship between the average and\nmaximum Lyapunov exponents and the longitudinal velocity correlation function.\nThis link, which leads to the closure of von Kàrmàn--Howarth and Corrsin\nequations, agrees with the relation obtained in the previous work, supporting\nthe proposed PDF calculation, at least for the purposes of the energy cascade\neffect estimation. Furthermore, through the property that the Lyapunov vectors\ntend to align to the direction of the maximum growth rate of trajectories\ndistance, we obtain the link between maximum and average Lyapunov exponents in\nline with the previous result.\n",
"title": "Finite scale local Lyapunov exponents distribution in fully developed homogeneous isotropic turbulence"
}
| null | null |
[
"Physics"
] | null | true | null |
17129
| null |
Validated
| null | null |
null |
{
"abstract": " We propose a new partial decoding algorithm for one-point Hermitian codes\nthat can decode up to the same number of errors as the Guruswami--Sudan\ndecoder. Simulations suggest that it has a similar failure probability as the\nlatter one. The algorithm is based on a recent generalization of the power\ndecoding algorithm for Reed--Solomon codes and does not require an expensive\nroot-finding step. In addition, it promises improvements for decoding\ninterleaved Hermitian codes.\n",
"title": "Improved Power Decoding of One-Point Hermitian Codes"
}
| null | null | null | null | true | null |
17130
| null |
Default
| null | null |
null |
{
"abstract": " In this article, we generalize the well-known result that ideals of\nNoetherian polynomial rings have only finitely many initial ideals to the\nsituation of ascending ideal chains in non-Noetherian polynomial rings. More\nprecisely, we study ideal chains in the polynomial ring $R=K[x_{i,j}\\,|\\,1\\leq\ni\\leq c,j\\in N]$ that are invariant under the action of the monoid $Inc(N)$ of\nstrictly increasing functions on $N$, which acts on $R$ by shifting the second\nvariable index. We show that for every such ideal chain, the number of initial\nideal chains with respect to term orders on $R$ that are compatible with the\naction of $Inc(N)$ is finite. As a consequence of this, we will see that\n$Inc(N)$-invariant ideals of $R$ have only finitely many initial ideals with\nrespect to $Inc(N)$-compatible term orders. The article also addresses the\nquestion of how many such term orders exist. We give a complete list of the\n$Inc(N)$-compatible term orders for the case $c=1$ and show that there are\ninfinitely many for $c >1$. This answers a question by Hillar, Kroner, Leykin.\n",
"title": "Finite numbers of initial ideals in non-Noetherian polynomial rings"
}
| null | null |
[
"Mathematics"
] | null | true | null |
17131
| null |
Validated
| null | null |
null |
{
"abstract": " We consider the relationship between two sufficient conditions for regularity\nof the Bergman Projection on smooth, bounded, pseudoconvex domains. We show\nthat if the set of infinite type points is reasonably well-behaved, then the\nexistence of a family of good vector fields in the sense of Boas and Straube\nimplies that the Diederich-Fornaess Index of the domain is equal to one.\n",
"title": "The Diederich-Fornaess Index and Good Vector Fields"
}
| null | null | null | null | true | null |
17132
| null |
Default
| null | null |
null |
{
"abstract": " We show that any self-complementary graph with $n$ vertices contains a\n$K_{\\lfloor \\frac{n+1}{2}\\rfloor}$ minor. We derive topological properties of\nself-complementary graphs.\n",
"title": "Complete Minors of Self-Complementary Graphs"
}
| null | null | null | null | true | null |
17133
| null |
Default
| null | null |
null |
{
"abstract": " We study the asymptotic behavior of estimators of a two-valued, discontinuous\ndiffusion coefficient in a Stochastic Differential Equation, called an\nOscillating Brownian Motion. Using the relation of the latter process with the\nSkew Brownian Motion, we propose two natural consistent estimators, which are\nvariants of the integrated volatility estimator and take the occupation times\ninto account. We show the stable convergence of the renormalized errors'\nestimations toward some Gaussian mixture, possibly corrected by a term that\ndepends on the local time. These limits stem from the lack of ergodicity as\nwell as the behavior of the local time at zero of the process. We test both\nestimators on simulated processes, finding a complete agreement with the\ntheoretical predictions.\n",
"title": "Statistical estimation of the Oscillating Brownian Motion"
}
| null | null | null | null | true | null |
17134
| null |
Default
| null | null |
null |
{
"abstract": " The paper discusses the magnetic state of zeta phase of iron nitride viz.\n$\\zeta$-Fe$_2$N on the basis of spin polarized first principles electronic\nstructure calculations together with a review of already published data.\nResults of our first principles study suggest that the ground state of\n$\\zeta$-Fe$_2$N is ferromagnetic (FM) with a magnetic moment of 1.528\n$\\mu_\\text{B}$ on the Fe site. The FM ground state is lower than the\nanti-ferromagnetic (AFM) state by 8.44 meV and non-magnetic(NM) state by 191\nmeV per formula unit. These results are important in view of reports which\nclaim that $\\zeta$-Fe$_2$N undergoes an AFM transition below 10K and others\nwhich do not observe any magnetic transition up to 4.2K. We argue that the\nexperimental results of AFM transition below 10K are inconclusive and we\npropose the presence of competing FM and AFM superexchange interactions between\nFe sites mediated by nitrogen atoms, which are consistent with\nGoodenough-Kanamori-Anderson rules. We find that the anti-ferromagnetically\ncoupled Fe sites are outnumbered by ferromagnetically coupled Fe sites leading\nto a stable FM ground state. A Stoner analysis of the results also supports our\nclaim of a FM ground state.\n",
"title": "Competing Ferromagnetic and Anti-Ferromagnetic interactions in Iron Nitride $ζ$-Fe$_2$N"
}
| null | null | null | null | true | null |
17135
| null |
Default
| null | null |
null |
{
"abstract": " Determining wavelength-dependent exoplanet radii measurements is an excellent\nway to probe the composition of exoplanet atmospheres. In light of this, Borsa\net al. (2016) sought to develop a technique to obtain such measurements by\ncomparing ground-based transmission spectra to the expected brightness\nvariations during an exoplanet transit. However, we demonstrate herein that\nthis is not possible due to the transit light curve normalisation necessary to\nremove the effects of the Earth's atmosphere on the ground-based observations.\nThis is because the recoverable exoplanet radius is set by the planet-to-star\nradius ratio within the transit light curve; we demonstrate this both\nanalytically and with simulated planet transits, as well as through a\nreanalysis of the HD 189733b data.\n",
"title": "A cautionary tale: limitations of a brightness-based spectroscopic approach to chromatic exoplanet radii"
}
| null | null |
[
"Physics"
] | null | true | null |
17136
| null |
Validated
| null | null |
null |
{
"abstract": " The major system is a mnemonic system that can be used to memorize sequences\nof numbers. In this work, we present a method to automatically generate\nsentences that encode a given number. We propose several encoding models and\ncompare the most promising ones in a password memorability study. The results\nof the study show that a model combining part-of-speech sentence templates with\nan $n$-gram language model produces the most memorable password\nrepresentations.\n",
"title": "Generating Memorable Mnemonic Encodings of Numbers"
}
| null | null | null | null | true | null |
17137
| null |
Default
| null | null |
null |
{
"abstract": " We present experimental results on the controlled de-excitation of Rydberg\nstates in a cold gas of Rb atoms. The effect of the van der Waals interactions\nbetween the Rydberg atoms is clearly seen in the de-excitation spectrum and\ndynamics. Our observations are confirmed by numerical simulations. In\nparticular, for off-resonant (facilitated) excitation we find that the\nde-excitation spectrum reflects the spatial arrangement of the atoms in the\nquasi one-dimensional geometry of our experiment. We discuss future\napplications of this technique and implications for detection and controlled\ndissipation schemes.\n",
"title": "De-excitation spectroscopy of strongly interacting Rydberg gases"
}
| null | null |
[
"Physics"
] | null | true | null |
17138
| null |
Validated
| null | null |
null |
{
"abstract": " We extend the theoretical analysis of a recently proposed single subspace\nlearning algorithm, called Dual Principal Component Pursuit (DPCP), to the case\nwhere the data are drawn from of a union of hyperplanes. To gain insight into\nthe properties of the $\\ell_1$ non-convex problem associated with DPCP, we\ndevelop a geometric analysis of a closely related continuous optimization\nproblem. Then transferring this analysis to the discrete problem, our results\nstate that as long as the hyperplanes are sufficiently separated, the dominant\nhyperplane is sufficiently dominant and the points are uniformly distributed\ninside the associated hyperplanes, then the non-convex DPCP problem has a\nunique global solution, equal to the normal vector of the dominant hyperplane.\nThis suggests the correctness of a sequential hyperplane learning algorithm\nbased on DPCP. A thorough experimental evaluation reveals that hyperplane\nlearning schemes based on DPCP dramatically improve over the state-of-the-art\nmethods for the case of synthetic data, while are competitive to the\nstate-of-the-art in the case of 3D plane clustering for Kinect data.\n",
"title": "Hyperplane Clustering Via Dual Principal Component Pursuit"
}
| null | null | null | null | true | null |
17139
| null |
Default
| null | null |
null |
{
"abstract": " End-to-end neural network based approaches to audio modelling are generally\noutperformed by models trained on high-level data representations. In this\npaper we present preliminary work that shows the feasibility of training the\nfirst layers of a deep convolutional neural network (CNN) model to learn the\ncommonly-used log-scaled mel-spectrogram transformation. Secondly, we\ndemonstrate that upon initializing the first layers of an end-to-end CNN\nclassifier with the learned transformation, convergence and performance on the\nESC-50 environmental sound classification dataset are similar to a CNN-based\nmodel trained on the highly pre-processed log-scaled mel-spectrogram features.\n",
"title": "Utilizing Domain Knowledge in End-to-End Audio Processing"
}
| null | null | null | null | true | null |
17140
| null |
Default
| null | null |
null |
{
"abstract": " Fully Programmable Valve Array (FPVA) has emerged as a new architecture for\nthe next-generation flow-based microfluidic biochips. This 2D-array consists of\nregularly-arranged valves, which can be dynamically configured by users to\nrealize microfluidic devices of different shapes and sizes as well as\ninterconnections. Additionally, the regularity of the underlying structure\nrenders FPVAs easier to integrate on a tiny chip. However, these arrays may\nsuffer from various manufacturing defects such as blockage and leakage in\ncontrol and flow channels. Unfortunately, no efficient method is yet known for\ntesting such a general-purpose architecture. In this paper, we present a novel\nformulation using the concept of flow paths and cut-sets, and describe an\nILP-based hierarchical strategy for generating compact test sets that can\ndetect multiple faults in FPVAs. Simulation results demonstrate the efficacy of\nthe proposed method in detecting manufacturing faults with only a small number\nof test vectors.\n",
"title": "Testing Microfluidic Fully Programmable Valve Arrays (FPVAs)"
}
| null | null |
[
"Computer Science"
] | null | true | null |
17141
| null |
Validated
| null | null |
null |
{
"abstract": " We define the extremal length of elements of the fundamental group of the\ntwice punctured complex plane and give upper and lower bounds for this\ninvariant. The bounds differ by a multiplicative constant. The main motivation\ncomes from $3$-braid invariants and their application.\n",
"title": "Fundamental groups, slalom curves and extremal length"
}
| null | null |
[
"Mathematics"
] | null | true | null |
17142
| null |
Validated
| null | null |
null |
{
"abstract": " We investigate properties of the ground state of a light quark matter with\nheavy quark impurities. This system exhibits the \"QCD Kondo effect\" where the\ninteraction strength between a light quark near the Fermi surface and a heavy\nquark increases with decreasing energy of the light quark towards the Fermi\nenergy, and diverges at some scale near the Fermi energy, called the Kondo\nscale. Around and below the Kondo scale, we must treat the dynamics\nnonperturbatively. As a typical nonperturbative method to treat the strong\ncoupling regime, we adopt a mean-field approach where we introduce a\ncondensate, the Kondo condensate, representing a mixing between a light quark\nand a heavy quark, and determine the ground state in the presence of the Kondo\ncondensate. We show that the ground state is a topologically non-trivial state\nand the heavy quark spin forms the hedgehog configuration in the momentum\nspace. We can define the Berry phase for the ground-state wavefunction in the\nmomentum space which is associated with a monopole at the position of a heavy\nquark. We also investigate fluctuations around the mean field in the\nrandom-phase approximation, and show the existence of (exciton-like) collective\nexcitations made of a hole $h$ of a light quark and a heavy quark $Q$.\n",
"title": "Topology and stability of the Kondo phase in quark matter"
}
| null | null | null | null | true | null |
17143
| null |
Default
| null | null |
null |
{
"abstract": " A gyrokinetic reduction is based on a specific ordering of the different\nsmall parameters characterizing the background magnetic field and the\nfluctuating electromagnetic fields. In this tutorial, we consider the following\nordering of the small parameters: $\\epsilon\\_B=\\epsilon\\_\\delta^2$ where\n$\\epsilon\\_B$ is the small parameter associated with spatial inhomogeneities of\nthe background magnetic field and $\\epsilon\\_\\delta$ characterizes the small\namplitude of the fluctuating fields. In particular, we do not make any\nassumption on the amplitude of the background magnetic field. Given this choice\nof ordering, we describe a self-contained and systematic derivation which is\nparticularly well suited for the gyrokinetic reduction, following a two-step\nprocedure. We follow the approach developed in [Sugama, Physics of Plasmas 7,\n466 (2000)]:In a first step, using a translation in velocity, we embed the\ntransformation performed on the symplectic part of the gyrocentre reduction in\nthe guiding-centre one. In a second step, using a canonical Lie transform, we\neliminate the gyroangle dependence from the Hamiltonian. As a consequence, we\nexplicitly derive the fully electromagnetic gyrokinetic equations at the second\norder in $\\epsilon\\_\\delta$.\n",
"title": "Second order nonlinear gyrokinetic theory : From the particle to the gyrocenter"
}
| null | null | null | null | true | null |
17144
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we study the properties of Carmichael numbers, false positives\nto several primality tests. We provide a classification for Carmichael numbers\nwith a proportion of Fermat witnesses of less than 50%, based on if the\nsmallest prime factor is greater than a determined lower bound. In addition, we\nconduct a Monte Carlo simulation as part of a probabilistic algorithm to detect\nif a given composite number is Carmichael. We modify this highly accurate\nalgorithm with a deterministic primality test to create a novel, more efficient\nalgorithm that differentiates between Carmichael numbers and prime numbers.\n",
"title": "On the Classification and Algorithmic Analysis of Carmichael Numbers"
}
| null | null | null | null | true | null |
17145
| null |
Default
| null | null |
null |
{
"abstract": " A general phase reduction method for a network of coupled dynamical elements\nexhibiting collective oscillations, which is applicable to arbitrary networks\nof heterogeneous dynamical elements, is developed. A set of coupled adjoint\nequations for phase sensitivity functions, which characterize phase response of\nthe collective oscillation to small perturbations applied to individual\nelements, is derived. Using the phase sensitivity functions, collective\noscillation of the network under weak perturbation can be described\napproximately by a one-dimensional phase equation. As an example, mutual\nsynchronization between a pair of collectively oscillating networks of\nexcitable and oscillatory FitzHugh-Nagumo elements with random coupling is\nstudied.\n",
"title": "Phase reduction and synchronization of a network of coupled dynamical elements exhibiting collective oscillations"
}
| null | null | null | null | true | null |
17146
| null |
Default
| null | null |
null |
{
"abstract": " Knowledge graphs are large, useful, but incomplete knowledge repositories.\nThey encode knowledge through entities and relations which define each other\nthrough the connective structure of the graph. This has inspired methods for\nthe joint embedding of entities and relations in continuous low-dimensional\nvector spaces, that can be used to induce new edges in the graph, i.e., link\nprediction in knowledge graphs. Learning these representations relies on\ncontrasting positive instances with negative ones. Knowledge graphs include\nonly positive relation instances, leaving the door open for a variety of\nmethods for selecting negative examples. In this paper we present an empirical\nstudy on the impact of negative sampling on the learned embeddings, assessed\nthrough the task of link prediction. We use state-of-the-art knowledge graph\nembeddings -- \\rescal , TransE, DistMult and ComplEX -- and evaluate on\nbenchmark datasets -- FB15k and WN18. We compare well known methods for\nnegative sampling and additionally propose embedding based sampling methods. We\nnote a marked difference in the impact of these sampling methods on the two\ndatasets, with the \"traditional\" corrupting positives method leading to best\nresults on WN18, while embedding based methods benefiting the task on FB15k.\n",
"title": "Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs"
}
| null | null | null | null | true | null |
17147
| null |
Default
| null | null |
null |
{
"abstract": " Many relevant tasks require an agent to reach a certain state, or to\nmanipulate objects into a desired configuration. For example, we might want a\nrobot to align and assemble a gear onto an axle or insert and turn a key in a\nlock. These goal-oriented tasks present a considerable challenge for\nreinforcement learning, since their natural reward function is sparse and\nprohibitive amounts of exploration are required to reach the goal and receive\nsome learning signal. Past approaches tackle these problems by exploiting\nexpert demonstrations or by manually designing a task-specific reward shaping\nfunction to guide the learning agent. Instead, we propose a method to learn\nthese tasks without requiring any prior knowledge other than obtaining a single\nstate in which the task is achieved. The robot is trained in reverse, gradually\nlearning to reach the goal from a set of start states increasingly far from the\ngoal. Our method automatically generates a curriculum of start states that\nadapts to the agent's performance, leading to efficient training on\ngoal-oriented tasks. We demonstrate our approach on difficult simulated\nnavigation and fine-grained manipulation problems, not solvable by\nstate-of-the-art reinforcement learning methods.\n",
"title": "Reverse Curriculum Generation for Reinforcement Learning"
}
| null | null | null | null | true | null |
17148
| null |
Default
| null | null |
null |
{
"abstract": " Recently we gave arguments that only two unique topologically different\nconfigurations of 7 equal all mutually touching round cylinders (the\nconfigurations being mirror reflections of each other) are possible in 3D,\nalthough a whole world of configurations is possible already for round\ncylinders of arbitrary radii. It was found that as many as 9 round cylinders\n(all mutually touching) are possible in 3D while the upper bound for arbitrary\ncylinders was estimated to be not more than 14 under plausible arguments. Now\nby using the chirality and Ring matrices that we introduced earlier for the\ntopological classification of line configurations, we have given arguments that\nthe maximal number of mutually touching straight infinite cylinders of\narbitrary cross-section (provided that its boundary is a smooth curve) in 3D\ncannot exceed 10. We generated numerically several configurations of 10\ncylinders, restricting ourselves with elliptic cylinders. Configurations of 8\nand 9 equal elliptic cylinders (all in mutually touching) are generated\nnumerically as well. A possibility and restriction of continuous\ntransformations from elliptic into round cylinder configurations are discussed.\nSome curious results concerning the properties of the chirality matrix (which\ncoincides with Seidel's adjacency matrix important for the Graph theory) are\npresented.\n",
"title": "Mutually touching infinite cylinders in the 3D world of lines"
}
| null | null | null | null | true | null |
17149
| null |
Default
| null | null |
null |
{
"abstract": " This paper is a tutorial on Formal Concept Analysis (FCA) and its\napplications. FCA is an applied branch of Lattice Theory, a mathematical\ndiscipline which enables formalisation of concepts as basic units of human\nthinking and analysing data in the object-attribute form. Originated in early\n80s, during the last three decades, it became a popular human-centred tool for\nknowledge representation and data analysis with numerous applications. Since\nthe tutorial was specially prepared for RuSSIR 2014, the covered FCA topics\ninclude Information Retrieval with a focus on visualisation aspects, Machine\nLearning, Data Mining and Knowledge Discovery, Text Mining and several others.\n",
"title": "Introduction to Formal Concept Analysis and Its Applications in Information Retrieval and Related Fields"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
17150
| null |
Validated
| null | null |
null |
{
"abstract": " We present the results of a multiwavelength investigation of the very X-ray\nluminous galaxy cluster MACSJ0553.4-3342 ($z = 0.4270$; hereafter MACSJ0553).\nCombining high-resolution data obtained with the Hubble Space Telescope and the\nChandra X-ray Observatory with ground-based galaxy spectroscopy, our analysis\nestablishes the system unambiguously as a binary, post-collision merger of\nmassive clusters. Key characteristics include perfect alignment of luminous and\ndark matter for one component, a separation of almost 650 kpc (in projection)\nbetween the dark-matter peak of the other subcluster and the second X-ray peak,\nextremely hot gas (k$T > 15$ keV) at either end of the merger axis, a potential\ncold front in the east, an unusually low gas mass fraction of approximately\n0.075 for the western component, a velocity dispersion of $1490_{-130}^{+104}$\nkm s$^{-1}$, and no indication of significant substructure along the line of\nsight. We propose that the MACSJ0553 merger proceeds not in the plane of the\nsky, but at a large inclination angle, is observed very close to turnaround,\nand that the eastern X-ray peak is the cool core of the slightly less massive\nwestern component that was fully stripped and captured by the eastern\nsubcluster during the collision. If correct, this hypothesis would make\nMACSJ0553 a superb target for a competitive study of ram-pressure stripping and\nthe collisional behaviour of luminous and dark matter during cluster formation.\n",
"title": "Fully stripped? The dynamics of dark and luminous matter in the massive cluster collision MACSJ0553.4$-$3342"
}
| null | null | null | null | true | null |
17151
| null |
Default
| null | null |
null |
{
"abstract": " Recently, the educational initiative TED-Ed has published a popular brain\nteaser coined the 'frog riddle', which illustrates non-intuitive implications\nof conditional probabilities. In its intended form, the frog riddle is a\nreformulation of the classic boy-girl paradox. However, the authors alter the\nnarrative of the riddle in a form, that subtly changes the way information is\nconveyed. The presented solution, unfortunately, does not take this point into\nfull account, and as a consequence, lacks consistency in the sense that\ndifferent parts of the problem are treated on unequal footing. We here review,\nhow the mechanism of receiving information matters, and why this is exactly the\nreason that such kind of problems challenge intuitive thinking. Subsequently,\nwe present a generalized solution, that accounts for the above difficulties,\nand preserves full logical consistency. Eventually, the relation to the\nboy-girl paradox is discussed.\n",
"title": "When intuition fails in assessing conditional risks: the example of the frog riddle"
}
| null | null | null | null | true | null |
17152
| null |
Default
| null | null |
null |
{
"abstract": " We consider the tuning parameter selection rules for nuclear norm regularized\nmultivariate linear regression (NMLR) in high-dimensional setting.\nHigh-dimensional multivariate linear regression is widely used in statistics\nand machine learning, and regularization technique is commonly applied to deal\nwith the special structures in high-dimensional data. As we know, how to select\nthe tuning parameter is an essential issue for regularization approach and it\ndirectly affects the model estimation performance. To the best of our\nknowledge, there are no rules about the tuning parameter selection for NMLR\nfrom the point of view of optimization. In order to establish such rules, we\nstudy the duality theory of NMLR. Then, we claim the choice of tuning parameter\nfor NMLR is based on the sample data and the solution of NMLR dual problem,\nwhich is a projection on a nonempty, closed and convex set. Moreover, based on\nthe (firm) nonexpansiveness and the idempotence of the projection operator, we\nbuild four tuning parameter selection rules PSR, PSRi, PSRfn and PSR+.\nFurthermore, we give a sequence of tuning parameters and the corresponding\nintervals for every rule, which states that the rank of the estimation\ncoefficient matrix is no more than a fixed number for the tuning parameter in\nthe given interval. The relationships between these rules are also discussed\nand PSR+ is the most efficient one to select the tuning parameter. Finally, the\nnumerical results are reported on simulation and real data, which show that\nthese four tuning parameter selection rules are valuable.\n",
"title": "Tuning parameter selection rules for nuclear norm regularized multivariate linear regression"
}
| null | null | null | null | true | null |
17153
| null |
Default
| null | null |
null |
{
"abstract": " Today's Internet traffic is mostly dominated by multimedia content and the\nprediction is that this trend will intensify in the future. Therefore, main\nInternet players, such as ISPs, content delivery platforms (e.g. Youtube,\nBitorrent, Netflix, etc) or CDN operators, need to understand the evolution of\nmultimedia content availability and popularity in order to adapt their\ninfrastructures and resources to satisfy clients requirements while they\nminimize their costs. This paper presents a thorough analysis on the evolution\nof multimedia content available in BitTorrent. Specifically, we analyze the\nevolution of four relevant metrics across different content categories: content\navailability, content popularity, content size and user's feedback. To this end\nwe leverage a large-scale dataset formed by 4 snapshots collected from the most\npopular BitTorrent portal, namely The Pirate Bay, between Nov. 2009 and Feb.\n2012. Overall our dataset is formed by more than 160k content that attracted\nmore than 185M of download sessions.\n",
"title": "Understanding the evolution of multimedia content in the Internet through BitTorrent glasses"
}
| null | null | null | null | true | null |
17154
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we consider the weak convergence of the Euler-Maruyama\napproximation for one dimensional stochastic differential equations involving\nthe local times of the unknown process. We use a transformation in order to\nremove the local time from the stochastic differential equations and we provide\nthe approximation of Euler-maruyama for the stochastic differential equations\nwithout local time. After that, we conclude the approximation of Euler-maruyama\nfor one dimensional stochastic differential equations involving the local times\nof the unknown process , and we provide the rate of weak convergence for any\nfunction G in a certain class.\n",
"title": "The weak rate of convergence for the Euler-Maruyama approximation of one-dimensional stochastic differential equations involving the local times of the unknown process"
}
| null | null | null | null | true | null |
17155
| null |
Default
| null | null |
null |
{
"abstract": " Nowadays, a problem of historical beadworks conservation in museum\ncollections is actual more than ever because of fatal corrosion of the 19th\ncentury glass beads. Vibrational spectroscopy is a powerful method for\ninvestigation of glass, namely, of correlation of the structure-chemical\ncomposition. Therefore, Fourier-transform infrared spectroscopy was used for\nexamination of degradation processes in cloudy turquoise glass beads, which in\ncontrast to other color ones deteriorate especially strongly. Micro-X-ray\nfluorescence spectrometry of samples has shown that lead-potassium glass\nPbO-K$_2$O-SiO$_2$ with small amount of Cu and Sb was used for manufacture of\ncloudy turquoise beads. Fourier-transform infrared spectroscopy study of the\nbeads at different stages of glass corrosion was carried out in the range from\n200 to 4000 cm$^{-1}$ in the attenuated total reflection mode. In all the\nspectra, we have observed shifts of two major absorption bands to low-frequency\nrange (~1000 and ~775 cm$^{-1}$) compared to ones typical for amorphous SiO2\n(~1100 and 800 cm$^{-1}$, respectively). Such an effect is connected with\nPb$^{2+}$ and K$^+$ appending to the glass network. The presence of a weak band\nat ~1630 cm$^{-1}$ in all the spectra is attributed to the adsorption of\nH$_2$O. After annealing of the beads, the band disappeared completely in less\ndeteriorated samples and became significantly weaker in more destroyed ones.\nBased on that we conclude that there is adsorbed molecular water on the beads.\nHowever, products of corrosion (e.g., alkali in the form of white crystals or\ndroplets of liquid alkali) were not observed on the glass surface. We have also\nobserved glass depolymerisation in the strongly degraded beads, which is\nexhibited in domination of the band peaked at ~1000 cm$^{-1}$.\n",
"title": "Study of deteriorating semiopaque turquoise lead-potassium glass beads at different stages of corrosion using micro-FTIR spectroscopy"
}
| null | null | null | null | true | null |
17156
| null |
Default
| null | null |
null |
{
"abstract": " In work of Higson-Roe the fundamental role of the signature as a homotopy and\nbordism invariant for oriented manifolds is made manifest in how it and related\nsecondary invariants define a natural transformation between the\n(Browder-Novikov-Sullivan-Wall) surgery exact sequence and a long exact\nsequence of C*-algebra K-theory groups.\nIn recent years the (higher) signature invariants have been extended from\nclosed oriented manifolds to a class of stratified spaces known as L-spaces or\nCheeger spaces. In this paper we show that secondary invariants, such as the\nrho-class, also extend from closed manifolds to Cheeger spaces. We revisit a\nsurgery exact sequence for stratified spaces originally introduced by\nBrowder-Quinn and obtain a natural transformation analogous to that of\nHigson-Roe. We also discuss geometric applications.\n",
"title": "Stratified surgery and K-theory invariants of the signature operator"
}
| null | null | null | null | true | null |
17157
| null |
Default
| null | null |
null |
{
"abstract": " Tensor decomposition methods are popular tools for learning latent variables\ngiven only lower-order moments of the data. However, the standard assumption is\nthat we have sufficient data to estimate these moments to high accuracy. In\nthis work, we consider the case in which certain dimensions of the data are not\nalways observed---common in applied settings, where not all measurements may be\ntaken for all observations---resulting in moment estimates of varying quality.\nWe derive a weighted tensor decomposition approach that is computationally as\nefficient as the non-weighted approach, and demonstrate that it outperforms\nmethods that do not appropriately leverage these less-observed dimensions.\n",
"title": "Weighted Tensor Decomposition for Learning Latent Variables with Partial Data"
}
| null | null | null | null | true | null |
17158
| null |
Default
| null | null |
null |
{
"abstract": " Consider the discrete quadratic phase Hilbert Transform acting on $\\ell^{2}$\nfinitely supported functions $$ H^{\\alpha} f(n) : = \\sum_{m \\neq 0} \\frac{e^{2\n\\pi i\\alpha m^2} f(n - m)}{m}. $$ We prove that, uniformly in $\\alpha \\in\n\\mathbb{T}$, there is a sparse bound for the bilinear form $\\langle H^{\\alpha}\nf , g \\rangle$. The sparse bound implies several mapping properties such as\nweighted inequalities in an intersection of Muckenhoupt and reverse Hölder\nclasses.\n",
"title": "Sparse Bounds for Discrete Quadratic Phase Hilbert Transform"
}
| null | null | null | null | true | null |
17159
| null |
Default
| null | null |
null |
{
"abstract": " The tree augmentation problem (TAP) is a fundamental network design problem,\nin which the input is a graph $G$ and a spanning tree $T$ for it, and the goal\nis to augment $T$ with a minimum set of edges $Aug$ from $G$, such that $T \\cup\nAug$ is 2-edge-connected.\nTAP has been widely studied in the sequential setting. The best known\napproximation ratio of 2 for the weighted case dates back to the work of\nFrederickson and JáJá, SICOMP 1981. Recently, a 3/2-approximation was\ngiven for the unweighted case by Kortsarz and Nutov, TALG 2016, and recent\nbreakthroughs by Adjiashvili, SODA 2017, and by Fiorini et al., 2017, give\napproximations better than 2 for bounded weights.\nIn this paper, we provide the first fast distributed approximations for TAP.\nWe present a distributed $2$-approximation for weighted TAP which completes in\n$O(h)$ rounds, where $h$ is the height of $T$. When $h$ is large, we show a\nmuch faster 4-approximation algorithm for the unweighted case, completing in\n$O(D+\\sqrt{n}\\log^*{n})$ rounds, where $n$ is the number of vertices and $D$ is\nthe diameter of $G$.\nImmediate consequences of our results are an $O(D)$-round 2-approximation\nalgorithm for the minimum size 2-edge-connected spanning subgraph, which\nsignificantly improves upon the running time of previous approximation\nalgorithms, and an $O(h_{MST}+\\sqrt{n}\\log^{*}{n})$-round 3-approximation\nalgorithm for the weighted case, where $h_{MST}$ is the height of the MST of\nthe graph. Additional applications are algorithms for verifying\n2-edge-connectivity and for augmenting the connectivity of any connected\nspanning subgraph to 2.\nFinally, we complement our study with proving lower bounds for distributed\napproximations of TAP.\n",
"title": "Fast Distributed Approximation for TAP and 2-Edge-Connectivity"
}
| null | null |
[
"Computer Science"
] | null | true | null |
17160
| null |
Validated
| null | null |
null |
{
"abstract": " Generative source separation methods such as non-negative matrix\nfactorization (NMF) or auto-encoders, rely on the assumption of an output\nprobability density. Generative Adversarial Networks (GANs) can learn data\ndistributions without needing a parametric assumption on the output density. We\nshow on a speech source separation experiment that, a multi-layer perceptron\ntrained with a Wasserstein-GAN formulation outperforms NMF, auto-encoders\ntrained with maximum likelihood, and variational auto-encoders in terms of\nsource to distortion ratio.\n",
"title": "Generative Adversarial Source Separation"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
17161
| null |
Validated
| null | null |
null |
{
"abstract": " We consider the problem of finding confidence intervals for the risk of\nforecasting the future of a stationary, ergodic stochastic process, using a\nmodel estimated from the past of the process. We show that a bootstrap\nprocedure provides valid confidence intervals for the risk, when the data\nsource is sufficiently mixing, and the loss function and the estimator are\nsuitably smooth. Autoregressive (AR(d)) models estimated by least squares obey\nthe necessary regularity conditions, even when mis-specified, and simulations\nshow that the finite- sample coverage of our bounds quickly converges to the\ntheoretical, asymptotic level. As an intermediate step, we derive sufficient\nconditions for asymptotic independence between empirical distribution functions\nformed by splitting a realization of a stochastic process, of independent\ninterest.\n",
"title": "Bootstrapping Generalization Error Bounds for Time Series"
}
| null | null | null | null | true | null |
17162
| null |
Default
| null | null |
null |
{
"abstract": " We report the magnetoresistance and nonlinear Hall effect studies over a wide\ntemperature range in pulsed laser deposited Ni0.07Zn0.93O thin film. Negative\nand positive contributions to magnetoresistance at high and low temperatures\nhave been successfully modeled by the localized magnetic moment and two band\nconduction process involving heavy and light hole subbands, respectively.\nNonlinearity in the Hall resistance also agrees well with the two channel\nconduction model. A negative Hall voltage has been found for T $\\gte 50 K$,\nimplying a dominant conduction mainly by electrons whereas positive Hall\nvoltage for T less than 50 K shows hole dominated conduction in this material.\nCrossover in the sign of magnetoresistance from negative to positive reveals\nthe spin polarization of the charge carriers and hence the applicability of Ni\ndoped ZnO thin film for spintronic applications.\n",
"title": "Sign reversal of magnetoresistance and p to n transition in Ni doped ZnO thin film"
}
| null | null | null | null | true | null |
17163
| null |
Default
| null | null |
null |
{
"abstract": " This volume contains the proceedings of F-IDE 2016, the third international\nworkshop on Formal Integrated Development Environment, which was held as an FM\n2016 satellite event, on November 8, 2016, in Limassol (Cyprus). High levels of\nsafety, security and also privacy standards require the use of formal methods\nto specify and develop compliant software (sub)systems. Any standard comes with\nan assessment process, which requires a complete documentation of the\napplication in order to ease the justification of design choices and the review\nof code and proofs. Thus tools are needed for handling specifications, program\nconstructs and verification artifacts. The aim of the F-IDE workshop is to\nprovide a forum for presenting and discussing research efforts as well as\nexperience returns on design, development and usage of formal IDE aiming at\nmaking formal methods \"easier\" for both specialists and non-specialists.\n",
"title": "Proceedings of the Third Workshop on Formal Integrated Development Environment"
}
| null | null |
[
"Computer Science"
] | null | true | null |
17164
| null |
Validated
| null | null |
null |
{
"abstract": " Animals (especially humans) have an amazing ability to learn new tasks\nquickly, and switch between them flexibly. How brains support this ability is\nlargely unknown, both neuroscientifically and algorithmically. One reasonable\nsupposition is that modules drawing on an underlying general-purpose sensory\nrepresentation are dynamically allocated on a per-task basis. Recent results\nfrom neuroscience and artificial intelligence suggest the role of the general\npurpose visual representation may be played by a deep convolutional neural\nnetwork, and give some clues how task modules based on such a representation\nmight be discovered and constructed. In this work, we investigate module\narchitectures in an embodied two-dimensional touchscreen environment, in which\nan agent's learning must occur via interactions with an environment that emits\nimages and rewards, and accepts touches as input. This environment is designed\nto capture the physical structure of the task environments that are commonly\ndeployed in visual neuroscience and psychophysics. We show that in this\ncontext, very simple changes in the nonlinear activations used by such a module\ncan significantly influence how fast it is at learning visual tasks and how\nsuitable it is for switching to new tasks.\n",
"title": "A Useful Motif for Flexible Task Learning in an Embodied Two-Dimensional Visual Environment"
}
| null | null | null | null | true | null |
17165
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we present a new approach to visual servoing for robotics,\nreferred to as 3D Move to See (3DMTS), based on the principle of finding the\nnext best view using a 3D camera array and a robotic manipulator to obtain\nmultiple samples of the scene from different perspectives. The method uses\nsemantic vision and an objective function applied to each perspective to sample\na gradient representing the direction of the next best view. The method is\ndemonstrated within simulation and on a real robotic platform containing a\ncustom 3D camera array for the challenging scenario of robotic harvesting in a\nhighly occluded and unstructured environment. It was shown on a real robotic\nplatform that by moving the end effector using the gradient of an objective\nfunction leads to a locally optimal view of the object of interest, even\namongst occlusions. The overall performance of the 3DMTS method obtained a mean\nincrease in target size by 29.3% compared to a baseline method using a single\nRGB-D camera, which obtained 9.17%. The results demonstrate qualitatively and\nquantitatively that the 3DMTS method performed better in most scenarios, and\nyielded three times the target size compared to the baseline method. The\nincreased target size in the final view will improve the detection of key\nfeatures of the object of interest for further manipulation, such as grasping\nand harvesting.\n",
"title": "3D Move to See: Multi-perspective visual servoing for improving object views with semantic segmentation"
}
| null | null | null | null | true | null |
17166
| null |
Default
| null | null |
null |
{
"abstract": " Epidemiological models for the spread of pathogens in a population are\nusually only able to describe a single pathogen. This makes their application\nunrealistic in cases where multiple pathogens with similar symptoms are\nspreading concurrently within the same population. Here we describe a method\nwhich makes possible the application of multiple single-strain models under\nminimal conditions. As such, our method provides a bridge between theoretical\nmodels of epidemiology and data-driven approaches for modeling of influenza and\nother similar viruses.\nOur model extends the Susceptible-Infected-Recovered model to higher\ndimensions, allowing the modeling of a population infected by multiple viruses.\nWe further provide a method, based on an overcomplete dictionary of feasible\nrealizations of SIR solutions, to blindly partition the time series\nrepresenting the number of infected people in a population into individual\ncomponents, each representing the effect of a single pathogen.\nWe demonstrate the applicability of our proposed method on five years of\nseasonal influenza-like illness (ILI) rates, estimated from Twitter data. We\ndemonstrate that our method describes, on average, 44\\% of the variance in the\nILI time series. The individual infectious components derived from our model\nare matched to known viral profiles in the populations, which we demonstrate\nmatches that of independently collected epidemiological data. We further show\nthat the basic reproductive numbers ($R0$) of the matched components are in\nrange known for these pathogens.\nOur results suggest that the proposed method can be applied to other\npathogens and geographies, providing a simple method for estimating the\nparameters of epidemics in a population.\n",
"title": "Modeling influenza-like illnesses through composite compartmental models"
}
| null | null | null | null | true | null |
17167
| null |
Default
| null | null |
null |
{
"abstract": " We study, with the help of a computer program, the Polish Algorithm for\nfinite terms satisfying various algebraic laws, e.g., left distributivity a(bc)\n= (ab)(ac). While the termination of the algorithm for left distributivity\nremains open in general, we can establish some partial results, which might be\nuseful towards a positive solution. In contrast, we show the divergence of the\nalgorithm for the laws a(bc) = (ab)(cc) and a(bc) = (ab)(a(ac)).\n",
"title": "Notes on the Polish Algorithm"
}
| null | null |
[
"Mathematics"
] | null | true | null |
17168
| null |
Validated
| null | null |
null |
{
"abstract": " We introduce a new class of mean regression estimators -- penalized maximum\ntangent likelihood estimation -- for high-dimensional regression estimation and\nvariable selection. We first explain the motivations for the key ingredient,\nmaximum tangent likelihood estimation (MTE), and establish its asymptotic\nproperties. We further propose a penalized MTE for variable selection and show\nthat it is $\\sqrt{n}$-consistent, enjoys the oracle property. The proposed\nclass of estimators consists penalized $\\ell_2$ distance, penalized exponential\nsquared loss, penalized least trimmed square and penalized least square as\nspecial cases and can be regarded as a mixture of minimum Kullback-Leibler\ndistance estimation and minimum $\\ell_2$ distance estimation. Furthermore, we\nconsider the proposed class of estimators under the high-dimensional setting\nwhen the number of variables $d$ can grow exponentially with the sample size\n$n$, and show that the entire class of estimators (including the aforementioned\nspecial cases) can achieve the optimal rate of convergence in the order of\n$\\sqrt{\\ln(d)/n}$. Finally, simulation studies and real data analysis\ndemonstrate the advantages of the penalized MTE.\n",
"title": "Penalized Maximum Tangent Likelihood Estimation and Robust Variable Selection"
}
| null | null | null | null | true | null |
17169
| null |
Default
| null | null |
null |
{
"abstract": " Large eddy simulation (LES) has become the de-facto computational tool for\nmodeling complex reacting flows, especially in gas turbine applications.\nHowever, readily usable general-purpose LES codes for complex geometries are\ntypically academic or proprietary/commercial in nature. The objective of this\nwork is to develop and disseminate an open source LES tool for low-Mach number\nturbulent combustion using the OpenFOAM framework. In particular, a\ncollocated-mesh approach suited for unstructured grid formulation is provided.\nUnlike other fluid dynamics models, LES accuracy is intricately linked to\nso-called primary and secondary conservation properties of the numerical\ndiscretization schemes. This implies that although the solver only evolves\nequations for mass, momentum, and energy, the implied discrete equation for\nkinetic energy (square of velocity) should be minimally-dissipative. Here, a\nspecific spatial and temporal discretization is imposed such that this kinetic\nenergy dissipation is minimized. The method is demonstrated using manufactured\nsolutions approach on regular and skewed meshes, a canonical flow problem, and\na turbulent sooting flame in a complex domain relevant to gas turbines\napplications.\n",
"title": "A minimally-dissipative low-Mach number solver for complex reacting flows in OpenFOAM"
}
| null | null | null | null | true | null |
17170
| null |
Default
| null | null |
null |
{
"abstract": " Surface stress and surface energy are fundamental quantities which\ncharacterize the interface between two materials. Although these quantities are\nidentical for interfaces involving only fluids, the Shuttleworth effect\ndemonstrates that this is not the case for most interfaces involving solids,\nsince their surface energies change with strain. Crystalline materials are\nknown to have strain dependent surface energies, but in amorphous materials,\nsuch as polymeric glasses and elastomers, the strain dependence is debated due\nto a dearth of direct measurements. Here, we utilize contact angle measurements\non strained glassy and elastomeric solids to address this matter. We show\nconclusively that interfaces involving polymeric glasses exhibit strain\ndependent surface energies, and give strong evidence for the absence of such a\ndependence for incompressible elastomers. The results provide fundamental\ninsight into our understanding of the interfaces of amorphous solids and their\ninteraction with contacting liquids.\n",
"title": "Surface energy of strained amorphous solids"
}
| null | null | null | null | true | null |
17171
| null |
Default
| null | null |
null |
{
"abstract": " The biaxial magnetic-field setup for angular magnetic measurements of thin\nfilm and spintronic devices is designed and presented. The setup allows for\napplication of the in-plane magnetic field using a quadrupole electromagnet,\ncontrolled by power supply units and integrated with an electromagnet biaxial\nmagnetic field sensor. In addition, the probe station is equipped with a\nmicrowave circuitry, which enables angle-resolved spin torque oscillation\nmeasurements. The angular dependencies of magnetoresistance and spin diode\neffect in a giant magnetoresistance strip are shown as an operational\nverification of the experimental setup. We adapted an analytical macrospin\nmodel to reproduce both the resistance and spin-diode angular dependency\nmeasurements.\n",
"title": "Biaxial magnetic field setup for angular magnetic measurements of thin films and spintronic nanodevices"
}
| null | null | null | null | true | null |
17172
| null |
Default
| null | null |
null |
{
"abstract": " We investigate the dynamics of a dilute suspension of hydrodynamically\ninteracting motile or immotile stress-generating swimmers or particles as they\ninvade a surrounding viscous fluid. Colonies of aligned pusher particles are\nshown to elongate in the direction of particle orientation and undergo a\ncascade of transverse concentration instabilities, governed at small times by\nan equation which also describes the Saffman-Taylor instability in a Hele-Shaw\ncell, or Rayleigh-Taylor instability in two-dimensional flow through a porous\nmedium. Thin sheets of aligned pusher particles are always unstable, while\nsheets of aligned puller particles can either be stable (immotile particles),\nor unstable (motile particles) with a growth rate which is non-monotonic in the\nforce dipole strength. We also prove a surprising \"no-flow theorem\": a\ndistribution initially isotropic in orientation loses isotropy immediately but\nin such a way that results in no fluid flow everywhere and for all time.\n",
"title": "Active matter invasion of a viscous fluid: unstable sheets and a no-flow theorem"
}
| null | null |
[
"Quantitative Biology"
] | null | true | null |
17173
| null |
Validated
| null | null |
null |
{
"abstract": " The formalism of partial information decomposition provides independent or\nnon-overlapping components constituting total information content provided by a\nset of source variables about the target variable. These components are\nrecognised as unique information, synergistic information and, redundant\ninformation. The metric of net synergy, conceived as the difference between\nsynergistic and redundant information, is capable of detecting synergy,\nredundancy and, information independence among stochastic variables. And it can\nbe quantified, as it is done here, using appropriate combinations of different\nShannon mutual information terms. Utilisation of such a metric in network\nmotifs with the nodes representing different biochemical species, involved in\ninformation sharing, uncovers rich store for interesting results. In the\ncurrent study, we make use of this formalism to obtain a comprehensive\nunderstanding of the relative information processing mechanism in a diamond\nmotif and two of its sub-motifs namely bifurcation and integration motif\nembedded within the diamond motif. The emerging patterns of synergy and\nredundancy and their effective contribution towards ensuring high fidelity\ninformation transmission are duly compared in the sub-motifs and independent\nmotifs (bifurcation and integration). In this context, the crucial roles played\nby various time scales and activation coefficients in the network topologies\nare especially emphasised. We show that the origin of synergy and redundancy in\ninformation transmission can be physically justified by decomposing diamond\nmotif into bifurcation and integration motif.\n",
"title": "Interplay of synergy and redundancy in diamond motif"
}
| null | null | null | null | true | null |
17174
| null |
Default
| null | null |
null |
{
"abstract": " We study the asymptotic behavior of a sequence of positive solutions\n$(u_{\\epsilon})_{\\epsilon >0}$ as $\\epsilon \\to 0$ to the family of equations\n\\begin{equation*} \\left\\{\\begin{array}{ll} \\Delta\nu_{\\epsilon}+a(x)u_{\\epsilon}=\n\\frac{u_{\\epsilon}^{2^*(s_{\\epsilon})-1}}{|x|^{s_{\\epsilon}}}& \\hbox{ in\n}\\Omega\\\\ u_{\\epsilon}=0 & \\hbox{ on }\\partial\\Omega. \\end{array}\\right.\n\\end{equation*} where $(s_{\\epsilon})_{\\epsilon >0}$ is a sequence of positive\nreal numbers such that $\\lim \\limits_{\\epsilon \\rightarrow 0} s_{\\epsilon}=0$,\n$2^{*}(s_{\\epsilon}):= \\frac{2(n-s_{\\epsilon})}{n-2}$ and $\\Omega \\subset\n\\mathbb{R}^{n}$ is a bounded smooth domain such that $0 \\in \\partial \\Omega$.\nWhen the sequence $(u_{\\epsilon})_{\\epsilon >0}$ is uniformly bounded in\n$L^{\\infty}$, then upto a subsequence it converges strongly to a minimizing\nsolution of the stationary Schrödinger equation with critical growth. In\ncase the sequence blows up, we obtain strong pointwise control on the blow up\nsequence, and then using the Pohozaev identity localize the point of\nsingularity, which in this case can at most be one, and derive precise blow up\nrates. In particular when $n=3$ or $a\\equiv 0$ then blow up can occur only at\nan interior point of $\\Omega$ or the point $0 \\in \\partial \\Omega$.\n",
"title": "Hardy-Sobolev equations with asymptotically vanishing singularity: Blow-up analysis for the minimal energy"
}
| null | null | null | null | true | null |
17175
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we present two new results to the classical Floquet theory,\nwhich provides the Floquet multipliers for two classes of the planar periodic\nsystem. One these results provides the Floquet multipliers independently of the\nsolution of system. To demonstrate the application of these analytical results,\nwe consider a cholera epidemic model with phage dynamics and seasonality\nincorporated.\n",
"title": "Some results on Ricatti Equations, Floquet Theory and Applications"
}
| null | null | null | null | true | null |
17176
| null |
Default
| null | null |
null |
{
"abstract": " Ultrathin two-dimensional nanosheets raise a rapidly increasing interest due\nto their unique dimensionality-dependent properties. Most of the\ntwo-dimensional materials are obtained by exfoliation of layered bulk materials\nor are grown on substrates by vapor deposition methods. To produce\nfree-standing nanosheets, solution-based colloidal methods are emerging as\npromising routes. In this work, we demonstrate ultrathin CdSe nanosheets with\ncontrollable size, shape and phase. The key of our approach is the use of\nhalogenated alkanes as additives in a hot-injection synthesis. Increasing\nconcentrations of bromoalkanes can tune the shape from sexangular to\nquadrangular to triangular and the phase from zinc blende to wurtzite. Geometry\nand crystal structure evolution of the nanosheets take place in the presence of\nhalide ions, acting as cadmium complexing agents and as surface X-type ligands,\naccording to mass spectrometry and X-ray photoelectron spectroscopies. Our\nexperimental findings show that the degree of these changes depends on the\nmolecular structure of the halogen alkanes and the type of halogen atom.\n",
"title": "Size, Shape, and Phase Control in Ultrathin CdSe Nanosheets"
}
| null | null |
[
"Physics"
] | null | true | null |
17177
| null |
Validated
| null | null |
null |
{
"abstract": " Resonant x-ray scattering at the Dy $M_5$ and Ni $L_3$ absorption edges was\nused to probe the temperature and magnetic field dependence of magnetic order\nin epitaxial LaNiO$_3$-DyScO$_3$ superlattices. For superlattices with 2 unit\ncell thick LaNiO$_3$ layers, a commensurate spiral state develops in the Ni\nspin system below 100 K. Upon cooling below $T_{ind} = 18$ K, Dy-Ni exchange\ninteractions across the LaNiO$_3$-DyScO$_3$ interfaces induce collinear\nmagnetic order of interfacial Dy moments as well as a reorientation of the Ni\nspins to a direction dictated by the strong magneto-crystalline anisotropy of\nDy. This transition is reversible by an external magnetic field of 3 T.\nTailored exchange interactions between rare-earth and transition-metal ions\nthus open up new perspectives for the manipulation of spin structures in\nmetal-oxide heterostructures and devices.\n",
"title": "Transfer of magnetic order and anisotropy through epitaxial integration of 3$d$ and 4$f$ spin systems"
}
| null | null | null | null | true | null |
17178
| null |
Default
| null | null |
null |
{
"abstract": " We answer a question of Durham, Hagen, and Sisto, proving that a\nTeichmüller geodesic ray does not necessarily converge to a unique point in\nthe hierarchically hyperbolic space boundary of Teichmüller space. In fact,\nwe prove that the limit set can be almost anything allowed by the topology.\n",
"title": "Exotic limit sets of Teichmüller geodesics in the HHS boundary"
}
| null | null | null | null | true | null |
17179
| null |
Default
| null | null |
null |
{
"abstract": " Deep learning requires data. A useful approach to obtain data is to be\ncreative and mine data from various sources, that were created for different\npurposes. Unfortunately, this approach often leads to noisy labels. In this\npaper, we propose a meta algorithm for tackling the noisy labels problem. The\nkey idea is to decouple \"when to update\" from \"how to update\". We demonstrate\nthe effectiveness of our algorithm by mining data for gender classification by\ncombining the Labeled Faces in the Wild (LFW) face recognition dataset with a\ntextual genderizing service, which leads to a noisy dataset. While our approach\nis very simple to implement, it leads to state-of-the-art results. We analyze\nsome convergence properties of the proposed algorithm.\n",
"title": "Decoupling \"when to update\" from \"how to update\""
}
| null | null | null | null | true | null |
17180
| null |
Default
| null | null |
null |
{
"abstract": " The anomalously large radii of strongly irradiated exoplanets have remained a\nmajor puzzle in astronomy. Based on a 2D steady state atmospheric circulation\nmodel, the validity of which is assessed by comparison to 3D calculations, we\nreveal a new mechanism, namely the advection of the potential temperature due\nto mass and longitudinal momentum conservation, a process occuring in the\nEarth's atmosphere or oceans. At depth, the vanishing heating flux forces the\natmospheric structure to converge to a hotter adiabat than the one obtained\nwith 1D calculations, implying a larger radius for the planet. Not only do the\ncalculations reproduce the observed radius of HD209458b, but also the observed\ncorrelation between radius inflation and irradiation for transiting planets.\nVertical advection of potential temperature induced by non uniform atmospheric\nheating thus provides a robust mechanism explaining the inflated radii of\nirradiated hot Jupiters.\n",
"title": "Advection of potential temperature in the atmosphere of irradiated exoplanets: a robust mechanism to explain radius inflation"
}
| null | null | null | null | true | null |
17181
| null |
Default
| null | null |
null |
{
"abstract": " Bands of vector-valued functions $f:T\\mapsto\\mathbb{R}^d$ are defined by\nconsidering convex hulls generated by their values concatenated at $m$\ndifferent values of the argument. The obtained $m$-bands are families of\nfunctions, ranging from the conventional band in case the time points are\nindividually considered (for $m=1$) to the convex hull in the functional space\nif the number $m$ of simultaneously considered time points becomes large enough\nto fill the whole time domain. These bands give rise to a depth concept that is\nnew both for real-valued and vector-valued functions.\n",
"title": "Band depths based on multiple time instances"
}
| null | null | null | null | true | null |
17182
| null |
Default
| null | null |
null |
{
"abstract": " In general, underestimation of risk is something which should be avoided as\nfar as possible. Especially in financial asset management, equity risk is\ntypically characterized by the measure of portfolio variance, or indirectly by\nquantities which are derived from it. Since there is a linear dependency of the\nvariance and the empirical correlation between asset classes, one is compelled\nto control or to avoid the possibility of underestimating correlation\ncoefficients. In the present approach, we formalize common practice and\nclassify these approaches by computing their probability of underestimation. In\naddition, we introduce a new estimator which is characterized by having the\nadvantage of a constant and controllable probability of underestimation. We\nprove that the new estimator is statistically consistent.\n",
"title": "On Biased Correlation Estimation"
}
| null | null | null | null | true | null |
17183
| null |
Default
| null | null |
null |
{
"abstract": " The atomic swap protocol allows for the exchange of cryptocurrencies on\ndifferent blockchains without the need to trust a third-party. However, market\nparticipants who desire to hold derivative assets such as options or futures\nwould also benefit from trustless exchange. In this paper I propose the atomic\nswaption, which extends the atomic swap to allow for such exchanges. Crucially,\natomic swaptions do not require the use of oracles. I also introduce the margin\ncontract, which provides the ability to create leveraged and short positions.\nLastly, I discuss how atomic swaptions may be routed on the Lightning Network.\n",
"title": "Atomic Swaptions: Cryptocurrency Derivatives"
}
| null | null |
[
"Quantitative Finance"
] | null | true | null |
17184
| null |
Validated
| null | null |
null |
{
"abstract": " We design, analyse and implement an arbitrary order scheme applicable to\ngeneric meshes for a coupled elliptic-parabolic PDE system describing miscible\ndisplacement in porous media. The discretisation is based on several\nadaptations of the Hybrid-High-Order (HHO) method due to Di Pietro et al.\n[Computational Methods in Applied Mathematics, 14(4), (2014)]. The equation\ngoverning the pressure is discretised using an adaptation of the HHO method for\nvariable diffusion, while the discrete concentration equation is based on the\nHHO method for advection-diffusion-reaction problems combined with numerically\nstable flux reconstructions for the advective velocity that we have derived\nusing the results of Cockburn et al. [ESAIM: Mathematical Modelling and\nNumerical Analysis, 50(3), (2016)]. We perform some rigorous analysis of the\nmethod to demonstrate its $L^2$ stability under the irregular data often\npresented by reservoir engineering problems and present several numerical tests\nto demonstrate the quality of the results that are produced by the proposed\nscheme.\n",
"title": "An arbitrary order scheme on generic meshes for miscible displacements in porous media"
}
| null | null |
[
"Computer Science"
] | null | true | null |
17185
| null |
Validated
| null | null |
null |
{
"abstract": " It is known that one can construct non-parametric functions by assuming\nclassical axioms. Our work is a converse to that: we prove classical axioms in\ndependent type theory assuming specific instances of non-parametricity. We also\naddress the interaction between classical axioms and the existence of\nautomorphisms of a type universe. We work over intensional Martin-Löf\ndependent type theory, and in some results assume further principles including\nfunction extensionality, propositional extensionality, propositional\ntruncation, and the univalence axiom.\n",
"title": "Parametricity, automorphisms of the universe, and excluded middle"
}
| null | null | null | null | true | null |
17186
| null |
Default
| null | null |
null |
{
"abstract": " We extend the classic convergence rate theory for subgradient methods to\napply to non-Lipschitz functions. For the deterministic projected subgradient\nmethod, we present a global $O(1/\\sqrt{T})$ convergence rate for any convex\nfunction which is locally Lipschitz around its minimizers. This approach is\nbased on Shor's classic subgradient analysis and implies generalizations of the\nstandard convergence rates for gradient descent on functions with Lipschitz or\nHölder continuous gradients. Further, we show a $O(1/\\sqrt{T})$ convergence\nrate for the stochastic projected subgradient method on convex functions with\nat most quadratic growth, which improves to $O(1/T)$ under either strong\nconvexity or a weaker quadratic lower bound condition.\n",
"title": "Convergence Rates for Deterministic and Stochastic Subgradient Methods Without Lipschitz Continuity"
}
| null | null | null | null | true | null |
17187
| null |
Default
| null | null |
null |
{
"abstract": " We introduce a practical calculation scheme for the description of excited\nelectron dynamics in molecular aggregated systems within a locally group\ndiabatic Fock representation. This scheme makes it easy to analyze the\ninteracting time-dependent excitations of local sites in complex systems. In\naddition, light-electron couplings are considered. The present scheme is\nintended for investigations on the migration dynamics of excited electrons in\nlight-energy conversion systems. The scheme was applied to two systems: a\nnaphthalene(NPTL)-tetracyanoethylene(TCNE) dimer and a 20-mer circle of\nethylene molecules. Through local group analyses of the dynamical electrons, we\nobtained an intuitive understanding of the electron transfers between the\nmonomers.\n",
"title": "A quantum dynamics method for excited electrons in molecular aggregate system using a group diabatic Fock matrix"
}
| null | null | null | null | true | null |
17188
| null |
Default
| null | null |
null |
{
"abstract": " We prove that if $H$ is a topological group such that all closed subgroups of\n$H$ are separable, then the product $G\\times H$ has the same property for every\nseparable compact group $G$.\nLet $c$ be the cardinality of the continuum. Assuming $2^{\\omega_1} = c$, we\nshow that there exist:\n(1) pseudocompact topological abelian groups $G$ and $H$ such that all closed\nsubgroups of $G$ and $H$ are separable, but the product $G\\times H$ contains a\nclosed non-separable $\\sigma$-compact subgroup;\n(2) pseudocomplete locally convex vector spaces $K$ and $L$ such that all\nclosed vector subspaces of $K$ and $L$ are separable, but the product $K\\times\nL$ contains a closed non-separable $\\sigma$-compact vector subspace.\n",
"title": "Products of topological groups in which all closed subgroups are separable"
}
| null | null | null | null | true | null |
17189
| null |
Default
| null | null |
null |
{
"abstract": " Differentiable systems in this paper means systems of equations that are\ndescribed by differentiable real functions in real matrix variables. This paper\nproposes algorithms for finding minimal rank solutions to such systems over\n(arbitrary and/or several structured) matrices by using the Levenberg-Marquardt\nmethod (LM-method) for solving least squares problems. We then apply these\nalgorithms to solve several engineering problems such as the low-rank matrix\ncompletion problem and the low-dimensional Euclidean embedding one. Some\nnumerical experiments illustrate the validity of the approach.\nOn the other hand, we provide some further properties of low rank solutions\nto systems linear matrix equations. This is useful when the differentiable\nfunction is linear or quadratic.\n",
"title": "Low rank solutions to differentiable systems over matrices and applications"
}
| null | null | null | null | true | null |
17190
| null |
Default
| null | null |
null |
{
"abstract": " The simulation of pedestrian crowd that reflects reality is a major challenge\nfor researches. Several crowd simulation models have been proposed such as\ncellular automata model, agent-based model, fluid dynamic model, etc. It is\nimportant to note that agent-based model is able, over others approaches, to\nprovide a natural description of the system and then to capture complex human\nbehaviors. In this paper, we propose a multi-agent simulation model in which\npedestrian positions are updated at discrete time intervals. It takes into\naccount the major normal conditions of a simple pedestrian situated in a crowd\nsuch as preferences, realistic perception of environment, etc. Our objective is\nto simulate the pedestrian crowd realistically towards a simulation of\nbelievable pedestrian behaviors. Typical pedestrian phenomena, including the\nunidirectional and bidirectional movement in a corridor as well as the flow\nthrough bottleneck, are simulated. The conducted simulations show that our\nmodel is able to produce realistic pedestrian behaviors. The obtained\nfundamental diagram and flow rate at bottleneck agree very well with classic\nconclusions and empirical study results. It is hoped that the idea of this\nstudy may be helpful in promoting the modeling and simulation of pedestrian\ncrowd in a simple way.\n",
"title": "A Simple and Realistic Pedestrian Model for Crowd Simulation and Application"
}
| null | null | null | null | true | null |
17191
| null |
Default
| null | null |
null |
{
"abstract": " The structural description for the intriguing link between the fast\nvibrational dynamics and slow diffusive dynamics in glass-forming systems is\none of the most challenging issues in physical science. Here, in a model of\nmetallic supercooled liquid, we find that local connectivity as an atomic-level\nstructural order parameter tunes the short-time vibrational excitations of the\nicosahedrally coordinated particles and meanwhile modulates their long-time\nrelaxation dynamics changing from stretched to compressed exponentials,\ndenoting a dynamic transition from subdiffusive to hyperdiffusive motions of\nsuch particles. Our result indicates that long-time dynamics has an\natomic-level structural origin which is related to the short-time dynamics,\nthus suggests a structural bridge to link the fast vibrational dynamics and the\nslow structural relaxation in glassy materials.\n",
"title": "Local connectivity modulates multi-scale relaxation dynamics in a metallic glass-forming system"
}
| null | null | null | null | true | null |
17192
| null |
Default
| null | null |
null |
{
"abstract": " Purpose: This paper focuses on an automated analysis of surgical motion\nprofiles for objective skill assessment and task recognition in robot-assisted\nsurgery. Existing techniques heavily rely on conventional statistic measures or\nshallow modelings based on hand-engineered features and gesture segmentation.\nSuch developments require significant expert knowledge, are prone to errors,\nand are less efficient in online adaptive training systems. Methods: In this\nwork, we present an efficient analytic framework with a parallel deep learning\narchitecture, SATR-DL, to assess trainee expertise and recognize surgical\ntraining activity. Through an end-to-end learning technique, abstract\ninformation of spatial representations and temporal dynamics is jointly\nobtained directly from raw motion sequences. Results: By leveraging a shared\nhigh-level representation learning, the resulting model is successful in the\nrecognition of trainee skills and surgical tasks, suturing, needle-passing, and\nknot-tying. Meanwhile, we explore the use of ensemble in classification at the\ntrial level, where the SATR-DL outperforms state-of-the-art performance by\nachieving accuracies of 0.960 and 1.000 in skill assessment and task\nrecognition, respectively. Conclusion: This study highlights the potential of\nSATR-DL to provide improvements for an efficient data-driven assessment in\nintelligent robotic surgery.\n",
"title": "SATR-DL: Improving Surgical Skill Assessment and Task Recognition in Robot-assisted Surgery with Deep Neural Networks"
}
| null | null | null | null | true | null |
17193
| null |
Default
| null | null |
null |
{
"abstract": " A strong mode of a probability measure on a normed space $X$ can be defined\nas a point $u$ such that the mass of the ball centred at $u$ uniformly\ndominates the mass of all other balls in the small-radius limit. Helin and\nBurger weakened this definition by considering only pairwise comparisons with\nballs whose centres differ by vectors in a dense, proper linear subspace $E$ of\n$X$, and posed the question of when these two types of modes coincide. We show\nthat, in a more general setting of metrisable vector spaces equipped with\nmeasures that are finite on bounded sets, the density of $E$ and a uniformity\ncondition suffice for the equivalence of these two types of modes. We\naccomplish this by introducing a new, intermediate type of mode. We also show\nthat these modes can be inequivalent if the uniformity condition fails. Our\nresults shed light on the relationships between among various notions of\nmaximum a posteriori estimator in non-parametric Bayesian inference.\n",
"title": "Equivalence of weak and strong modes of measures on topological vector spaces"
}
| null | null |
[
"Mathematics",
"Statistics"
] | null | true | null |
17194
| null |
Validated
| null | null |
null |
{
"abstract": " Motivated by the theory of quasi-determinants, we study non-commutative\nalgebras of quasi-Plücker coordinates. We prove that these algebras provide\nnew examples of non-homogeneous quadratic Koszul algebras by showing that their\nquadratic duals have quadratic Gröbner bases.\n",
"title": "Algebras of Quasi-Plücker Coordinates are Koszul"
}
| null | null |
[
"Mathematics"
] | null | true | null |
17195
| null |
Validated
| null | null |
null |
{
"abstract": " We introduce a Multi-modal Neural Machine Translation model in which a\ndoubly-attentive decoder naturally incorporates spatial visual features\nobtained using pre-trained convolutional neural networks, bridging the gap\nbetween image description and translation. Our decoder learns to attend to\nsource-language words and parts of an image independently by means of two\nseparate attention mechanisms as it generates words in the target language. We\nfind that our model can efficiently exploit not just back-translated in-domain\nmulti-modal data but also large general-domain text-only MT corpora. We also\nreport state-of-the-art results on the Multi30k data set.\n",
"title": "Doubly-Attentive Decoder for Multi-modal Neural Machine Translation"
}
| null | null | null | null | true | null |
17196
| null |
Default
| null | null |
null |
{
"abstract": " Phase retrieval algorithms have become an important component in many modern\ncomputational imaging systems. For instance, in the context of ptychography and\nspeckle correlation imaging, they enable imaging past the diffraction limit and\nthrough scattering media, respectively. Unfortunately, traditional phase\nretrieval algorithms struggle in the presence of noise. Progress has been made\nrecently on more robust algorithms using signal priors, but at the expense of\nlimiting the range of supported measurement models (e.g., to Gaussian or coded\ndiffraction patterns). In this work we leverage the regularization-by-denoising\nframework and a convolutional neural network denoiser to create prDeep, a new\nphase retrieval algorithm that is both robust and broadly applicable. We test\nand validate prDeep in simulation to demonstrate that it is robust to noise and\ncan handle a variety of system models.\nA MatConvNet implementation of prDeep is available at\nthis https URL.\n",
"title": "prDeep: Robust Phase Retrieval with a Flexible Deep Network"
}
| null | null | null | null | true | null |
17197
| null |
Default
| null | null |
null |
{
"abstract": " The Cobalt-germanium (Co-Ge) is a fascinating complex alloy system that has\nunique structure and exhibit range of interesting magnetic properties which\nwould change when reduce to nanoscale dimension. At this experimental work, the\nhigh-aspect-ratio Co5Ge3 nanoparticle with average size of 8nm was synthesized\nby gas aggregation-type cluster-deposition technology. The nanostructure\nmorphology of the as-made binary Co5Ge3 nanoparticles demonstrate excellent\nsingle-crystalline hexagonal structure with mostly preferable growth along\n(110) and (102) directions. In contrast the bulk possess Pauli paramagnetic\nspin-order at all range of temperature, here we discover size-driven new\nmagnetic ordering of as-synthesized Co5Ge3 nanoparticles exhibiting\nferromagnetism at room temperature with saturation magnetization of Ms = 32.2\nemu/cm3. This is first report of observing such new magnetic spin ordering in\nthis kind of material at nano-size which the magnetization has lower\nsensitivity to thermal energy fluctuation and exhibit high Curie temperature\nclose to 850 K. This ferromagnetic behavior along with higher Curie temperature\nat Co5Ge3 nanoparticles are attributes to low-dimension and quantum-confinement\neffect which imposes strong spin coupling and provides a new set of size-driven\nspin structures in Co5Ge3 nanoparticle which no such magnetic behavior being\npresent in the bulk of same material. This fundamental scientific study\nprovides important insights into the formation, structural, and the magnetic\nproperty of sub 10nm Co5Ge3 nanostructure which shall lead to promising\npractical versatile applications for magneto- germanide based nano-devices.\n",
"title": "Novel Exotic Magnetic Spin-order in Co5Ge3 Nano-size Materials"
}
| null | null | null | null | true | null |
17198
| null |
Default
| null | null |
null |
{
"abstract": " Many image-to-image translation problems are ambiguous, as a single input\nimage may correspond to multiple possible outputs. In this work, we aim to\nmodel a \\emph{distribution} of possible outputs in a conditional generative\nmodeling setting. The ambiguity of the mapping is distilled in a\nlow-dimensional latent vector, which can be randomly sampled at test time. A\ngenerator learns to map the given input, combined with this latent code, to the\noutput. We explicitly encourage the connection between output and the latent\ncode to be invertible. This helps prevent a many-to-one mapping from the latent\ncode to the output during training, also known as the problem of mode collapse,\nand produces more diverse results. We explore several variants of this approach\nby employing different training objectives, network architectures, and methods\nof injecting the latent code. Our proposed method encourages bijective\nconsistency between the latent encoding and output modes. We present a\nsystematic comparison of our method and other variants on both perceptual\nrealism and diversity.\n",
"title": "Toward Multimodal Image-to-Image Translation"
}
| null | null | null | null | true | null |
17199
| null |
Default
| null | null |
null |
{
"abstract": " This paper addresses the optimal control problem known as the Linear\nQuadratic Regulator in the case when the dynamics are unknown. We propose a\nmulti-stage procedure, called Coarse-ID control, that estimates a model from a\nfew experimental trials, estimates the error in that model with respect to the\ntruth, and then designs a controller using both the model and uncertainty\nestimate. Our technique uses contemporary tools from random matrix theory to\nbound the error in the estimation procedure. We also employ a recently\ndeveloped approach to control synthesis called System Level Synthesis that\nenables robust control design by solving a convex optimization problem. We\nprovide end-to-end bounds on the relative error in control cost that are nearly\noptimal in the number of parameters and that highlight salient properties of\nthe system to be controlled such as closed-loop sensitivity and optimal control\nmagnitude. We show experimentally that the Coarse-ID approach enables efficient\ncomputation of a stabilizing controller in regimes where simple control schemes\nthat do not take the model uncertainty into account fail to stabilize the true\nsystem.\n",
"title": "On the Sample Complexity of the Linear Quadratic Regulator"
}
| null | null | null | null | true | null |
17200
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.