text stringlengths 8 3.91k | label int64 0 10 |
|---|---|
abstract
we describe a class of systems theory based neural networks
called “network of recurrent neural networks” (nor),
which introduces a new structure level to rnn related models. in nor, rnns are viewed as the high-level neurons and
are used to build the high-level layers. more specifically,
we propose several met... | 9 |
abstract. in [bc], the second de rham cohomology groups of nilpotent orbits in all the complex
simple lie algebras are described. in this paper we consider non-compact non-complex exceptional
lie algebras, and compute the dimensions of the second cohomology groups for most of the nilpotent
orbits. for the rest of cases... | 4 |
abstract
let r be a commutative ring with identity and specs (m ) denote the
set all second submodules of an r-module m . in this paper, we construct and study a sheaf of modules, denoted by o(n, m ), on specs (m )
equipped with the dual zariski topology of m , where n is an r-module.
we give a characterization of the ... | 0 |
abstract
automatic multi-organ segmentation of the dual energy computed tomography (dect) data can be beneficial for biomedical research and clinical applications. however, it is a challenging task. recent advances in deep learning showed the
feasibility to use 3-d fully convolutional networks (fcn)
for voxel-wise dens... | 1 |
abstract. we bring additional support to the conjecture saying that a rational
cuspidal plane curve is either free or nearly free. this conjecture was confirmed
for curves of even degree, and in this note we prove it for many odd degrees. in
particular, we show that this conjecture holds for the curves of degree at most... | 0 |
abstract group g with the linear group ρ(g) ⊂ gl(v ). let vaff be the affine
space corresponding to v . the group of affine transformations of vaff whose linear part
lies in g may then be written g ⋉ v (where v stands for the group of translations). here
is the main result of this paper.
main theorem. suppose that ρ sa... | 4 |
abstract
little by little, newspapers are revealing the bright future that artificial intelligence (ai) is building. intelligent machines will help everywhere. however, this
bright future has a dark side: a dramatic job market contraction before its unpredictable transformation. hence, in a near future, large numbers of... | 2 |
abstract. many results are known about test ideals and f -singularities for q-gorenstein
rings. in this paper we generalize many of these results to the case when the symbolic rees
algebra ox ⊕ ox (−kx ) ⊕ ox (−2kx ) ⊕ . . . is finitely generated (or more generally, in the
log setting for −kx − ∆). in particular, we sh... | 0 |
abstract—due to the huge availability of documents in digital
form, and the deception possibility raise bound to the essence of
digital documents and the way they are spread, the authorship
attribution problem has constantly increased its relevance. nowadays, authorship attribution, for both information retrieval and
a... | 9 |
abstract—nondeterminism in scheduling is the cardinal reason
for difficulty in proving correctness of concurrent programs.
a powerful proof strategy was recently proposed [6] to show
the correctness of such programs. the approach captured dataflow dependencies among the instructions of an interleaved and
error-free exe... | 6 |
abstract. we get the computable error bounds for generalized
cornish-fisher expansions for quantiles of statistics provided that
the computable error bounds for edgeworth-chebyshev type expansions for distributions of these statistics are known. the results
are illustrated by examples. | 10 |
abstract | 2 |
abstract
since its discovery, differential linear logic (dll) inspired numerous
domains. in denotational semantics, categorical models of dll are now
commune, and the simplest one is rel, the category of sets and relations.
in proof theory this naturally gave birth to differential proof nets that are
full and complete ... | 6 |
abstract. the whitney extension theorem is a classical result in analysis giving a necessary
and sufficient condition for a function defined on a closed set to be extendable to the whole
space with a given class of regularity. it has been adapted to several settings, among which
the one of carnot groups. however, the t... | 4 |
abstract
a well known n p-hard problem called the generalized traveling salesman
problem (gtsp) is considered. in gtsp the nodes of a complete undirected
graph are partitioned into clusters. the objective is to find a minimum cost
tour passing through exactly one node from each cluster.
an exact exponential time algori... | 9 |
abstract | 6 |
abstract
in this paper we present a general convex optimization approach for solving highdimensional multiple response tensor regression problems under low-dimensional structural assumptions. we consider using convex and weakly decomposable regularizers
assuming that the underlying tensor lies in an unknown low-dimensi... | 10 |
abstract-- for dynamic security assessment considering
uncertainties in grid operations, this paper proposes an approach
for time-domain simulation of a power system having stochastic
loads. the proposed approach solves a stochastic differential
equation model of the power system in a semi-analytical way using
the adom... | 3 |
abstract
enhancing low resolution images via super-resolution
or image synthesis for cross-resolution face recognition
has been well studied. several image processing and machine learning paradigms have been explored for addressing the same. in this research, we propose synthesis via
deep sparse representation algorith... | 1 |
abstract. in this work we present a flexible tool for tumor progression,
which simulates the evolutionary dynamics of cancer. tumor progression
implements a multi-type branching process where the key parameters
are the fitness landscape, the mutation rate, and the average time of
cell division. the fitness of a cancer ... | 5 |
abstract
in coding theory, gray isometries are usually defined as mappings
between finite frobenius rings, which include the ring ℤ𝑚 of integers
modulo m and the finite fields. in this paper, we derive an isometric
mapping from ℤ8 to ℤ24 from the composition of the gray isometries on
ℤ8 and on ℤ24 . the image under th... | 7 |
abstract
many video processing algorithms rely on optical flow to
register different frames within a sequence. however, a precise estimation of optical flow is often neither tractable nor
optimal for a particular task. in this paper, we propose taskoriented flow (toflow), a flow representation tailored for
specific vid... | 1 |
abstract— the new type of mobile ad hoc network which is called vehicular ad hoc networks (vanet) created a fertile
environment for research.
in this research, a protocol particle swarm optimization contention based broadcast (pcbb) is proposed, for fast and effective
dissemination of emergency messages within a geogra... | 9 |
abstract
in this paper, we show that there is an o(log k log2 n)-competitive
randomized algorithm for the k-sever problem on any metric space
with n points, which improved the previous best competitive ratio
o(log2 k log3 n log log n) by nikhil bansal et al. (focs 2011, pages 267276).
keywords: k-sever problem; online ... | 8 |
abstract—this paper considers a smart grid cyber-security
problem analyzing the vulnerabilities of electric power networks
to false data attacks. the analysis problem is related to a
constrained cardinality minimization problem. the main result
shows that an l1 relaxation technique provides an exact optimal
solution to... | 5 |
abstract— here we propose using the successor representation
(sr) to accelerate learning in a constructive knowledge system
based on general value functions (gvfs). in real-world settings
like robotics for unstructured and dynamic environments, it is
infeasible to model all meaningful aspects of a system and its
enviro... | 2 |
abstract
motivated by applications in declarative data analysis, we study datalog z —an extension of positive datalog with arithmetic functions over integers. this language is known to be undecidable, so
we propose two fragments. in limit datalog z predicates are axiomatised to keep minimal/maximal
numeric values, allo... | 2 |
abstract—compute and forward (cf) is a promising relaying scheme which, instead of decoding single messages or
forwarding/amplifying information at the relay, decodes linear
combinations of the simultaneously transmitted messages. the
current literature includes several coding schemes and results
on the degrees of free... | 7 |
abstract—multi-frame image super-resolution (misr) aims
to fuse information in low-resolution (lr) image sequence to
compose a high-resolution (hr) one, which is applied extensively in many areas recently. different with single image super-resolution (sisr), sub-pixel transitions between multiple
frames introduce addit... | 1 |
abstract. let m be a module over a commutative ring r. in this paper,
we continue our study of annihilating-submodule graph ag(m ) which was
introduced in (the zariski topology-graph of modules over commutative rings,
comm. algebra., 42 (2014), 3283–3296). ag(m ) is a (undirected) graph in
which a nonzero submodule n o... | 0 |
abstract. this paper studies nonparametric series estimation and inference
for the effect of a single variable of interest x on an outcome y in the presence of potentially high-dimensional conditioning variables z. the context is
an additively separable model e[y|x, z] = g0 (x) + h0 (z). the model is highdimensional in... | 10 |
abstract
we investigate the asymptotic distributions of coordinates of regression m-estimates
in the moderate p/n regime, where the number of covariates p grows proportionally with the sample size n. under appropriate regularity conditions, we establish the coordinate-wise asymptotic normality of regression m-estimates... | 10 |
abstract
in this paper we provide the complete classification of kleinian
group of hausdorff dimensions less than 1. in particular, we prove
that every purely loxodromic kleinian groups of hausdorff dimension
< 1 is a classical schottky group. this upper bound is sharp. as an
application, the result of [4] then implies... | 4 |
abstract
string searching consists in locating a substring in a longer text, and two strings can be
approximately equal (various similarity measures such as the hamming distance exist).
strings can be defined very broadly, and they usually contain natural language and
biological data (dna, proteins), but they can also ... | 8 |
abstract. this is an exposition on the general neron desingularization and its
applications. we end with a recent constructive form of this desingularization in
dimension one.
key words : artin approximation, neron desingularization, bass-quillen conjecture, quillen’s question, smooth morphisms, regular morphisms, smoo... | 0 |
abstract. an axiomatic characterization of buildings of type c3 due to tits is used to prove
that any cohomogeneity two polar action of type c3 on a positively curved simply connected
manifold is equivariantly diffeomorphic to a polar action on a rank one symmetric space. this
includes two actions on the cayley plane w... | 4 |
abstract—this paper introduces the time synchronization attack rejection and mitigation (tsarm) technique for
time synchronization attacks (tsas) over the global positioning system (gps). the technique estimates the clock
bias and drift of the gps receiver along with the possible
attack contrary to previous approaches.... | 3 |
abstract—we show that the spectral efficiency of a direct
detection transmission system is at most 1 bit/s/hz less than the
spectral efficiency of a system employing coherent detection with
the same modulation format. correspondingly, the capacity per
complex degree of freedom in systems using direct detection is
lower... | 7 |
abstract
three dimensional digital model of a representative human kidney is needed
for a surgical simulator that is capable of simulating a laparoscopic surgery
involving kidney. buying a three dimensional computer model of a
representative human kidney, or reconstructing a human kidney from an
image sequence using co... | 5 |
abstract. we show that jn , the stanley-reisner ideal of the n-cycle, has a free resolution
supported on the (n − 3)-dimensional simplicial associahedron an . this resolution is not
minimal for n ≥ 6; in this case the betti numbers of jn are strictly smaller than the f -vector
of an . we show that in fact the betti num... | 0 |
abstract
a direct adaptive feedforward control method for tracking repeatable runout (rro) in bit patterned media recording
(bpmr) hard disk drives (hdd) is proposed. the technique estimates the system parameters and the residual rro simultaneously and constructs a feedforward signal based on a known regressor. an impr... | 3 |
abstract. websites today routinely combine javascript from multiple sources, both trusted and untrusted. hence, javascript security is
of paramount importance. a specific interesting problem is information
flow control (ifc) for javascript. in this paper, we develop, formalize
and implement a dynamic ifc mechanism for ... | 6 |
abstract—this paper studies the solution of joint energy
storage (es) ownership sharing between multiple shared facility
controllers (sfcs) and those dwelling in a residential community.
the main objective is to enable the residential units (rus) to
decide on the fraction of their es capacity that they want to
share wi... | 3 |
abstract. for a homogeneous polynomial with a non-zero discriminant, we
interpret direct sum decomposability of the polynomial in terms of factorization properties of the macaulay inverse system of its milnor algebra. this
leads to an if-and-only-if criterion for direct sum decomposability of such a
polynomial, and to ... | 0 |
abstract
deep learning on graphs has become a popular
research topic with many applications. however,
past work has concentrated on learning graph embedding tasks, which is in contrast with advances
in generative models for images and text. is it
possible to transfer this progress to the domain of
graphs? we propose to... | 9 |
abstract. a single qubit may be represented on the bloch sphere or
similarly on the 3-sphere s 3 . our goal is to dress this correspondence by
converting the language of universal quantum computing (uqc) to that
of 3-manifolds. a magic state and the pauli group acting on it define a
model of uqc as a povm that one reco... | 4 |
abstract
we present an accurate and efficient discretization approach for
the adaptive discretization of typical model equations employed in
numerical weather prediction. a semi-lagrangian approach is combined with the tr-bdf2 semi-implicit time discretization method
and with a spatial discretization based on adaptive ... | 5 |
abstract
urban rail transit often operates with high service frequencies to serve heavy passenger demand
during rush hours. such operations can be delayed by train congestion, passenger congestion, and
the interaction of the two. delays are problematic for many transit systems, as they become
amplified by this interact... | 3 |
abstract. in this paper, we formulate an analogue of waring’s problem for an algebraic group g. at the field level we consider a morphism
of varieties f : a1 → g and ask whether every element of g(k) is the
product of a bounded number of elements f (a1 (k)) = f (k). we give
an affirmative answer when g is unipotent and... | 4 |
abstract
we study the following multiagent variant of the knapsack problem. we are given a
set of items, a set of voters, and a value of the budget; each item is endowed with a cost
and each voter assigns to each item a certain value. the goal is to select a subset of items
with the total cost not exceeding the budget,... | 8 |
abstract. we describe triples and systems, expounded as an axiomatic algebraic umbrella theory for
classical algebra, tropical algebra, hyperfields, and fuzzy rings. | 0 |
abstract
in this paper, random forests are proposed for operating devices diagnostics in the presence of a variable number of features. in various
contexts, like large or difficult-to-access monitored areas, wired sensor
networks providing features to achieve diagnostics are either very costly
to use or totally impossi... | 2 |
abstract
deep convolutional neural networks (cnns) are more powerful
than deep neural networks (dnn), as they are able to better reduce
spectral variation in the input signal. this has also been confirmed
experimentally, with cnns showing improvements in word error
rate (wer) between 4-12% relative compared to dnns acr... | 9 |
abstract— this paper presents a practical approach for
identifying unknown mechanical parameters, such as mass
and friction models of manipulated rigid objects or actuated
robotic links, in a succinct manner that aims to improve the
performance of policy search algorithms. key features of this
approach are the use of o... | 2 |
abstract
prior to the financial crisis mortgage securitization models increased in sophistication as did products
built to insure against losses. layers of complexity formed upon a foundation that could not support
it and as the foundation crumbled the housing market followed. that foundation was the gaussian
copula wh... | 5 |
abstract
we construct new examples of cat(0) groups containing non finitely
presented subgroups that are of type f p2 , these cat(0) groups do not
contain copies of z3 . we also give a construction of groups which are of
type fn but not fn`1 with no free abelian subgroups of rank greater than
r n3 s. | 4 |
abstract— in this paper, we propose an automated computer
platform for the purpose of classifying electroencephalography
(eeg) signals associated with left and right hand movements
using a hybrid system that uses advanced feature extraction
techniques and machine learning algorithms. it is known that
eeg represents the... | 9 |
abstract
we prove a new and general concentration inequality for the excess risk in least-squares regression
with random design and heteroscedastic noise. no specific structure is required on the model, except the
existence of a suitable function that controls the local suprema of the empirical process. so far, only th... | 10 |
abstract. let x be a building, identified with its davis realisation. in this
paper, we provide for each x ∈ x and each η in the visual boundary ∂x of
x a description of the geodesic ray bundle geo(x, η), namely, of the union of
all combinatorial geodesic rays (corresponding to infinite minimal galleries in
the chamber... | 4 |
abstract. a feature-oriented product line is a family of programs that share a
common set of features. a feature implements a stakeholder’s requirement, represents a design decision and configuration option and, when added to a program,
involves the introduction of new structures, such as classes and methods, and the
r... | 6 |
abstract. a multigraph is a nonsimple graph which is permitted to have
multiple edges, that is, edges that have the same end nodes. we introduce
the concept of spanning simplicial complexes ∆s (g) of multigraphs g, which
provides a generalization of spanning simplicial complexes of associated
simple graphs. we give fir... | 0 |
abstract. it has been conjectured by eisenbud, green and harris that if i is
a homogeneous ideal in k[x1 , . . . , xn ] containing a regular sequence f1 , . . . , fn
of degrees deg(fi ) = ai , where 2 ≤ a1 ≤ ⋯ ≤ an , then there is a homogeneous
an
1
ideal j containing xa
1 , . . . , xn with the same hilbert function. i... | 0 |
abstract. a group is tubular if it acts on a tree with z2 vertex stabilizers and
z edge stabilizers. we prove that a tubular group is virtually special if and only
if it acts freely on a locally finite cat(0) cube complex. furthermore, we prove
that if a tubular group acts freely on a finite dimensional cat(0) cube com... | 4 |
abstract—successful fine-grained image classification methods
learn subtle details between visually similar (sub-)classes, but
the problem becomes significantly more challenging if the details
are missing due to low resolution. encouraged by the recent
success of convolutional neural network (cnn) architectures
in imag... | 1 |
abstract
this paper explains genetic algorithm for novice in this field. basic philosophy of genetic
algorithm and its flowchart are described. step by step numerical computation of genetic
algorithm for solving simple mathematical equality problem will be briefly explained. | 9 |
abstract. we construct 2-generator non-hopfian groups gm , m = 3, 4, 5, . . . ,
where each gm has a specific presentation gm = ha, b | urm,0 = urm,1 = urm,2 =
· · · = 1i which satisfies small cancellation conditions c(4) and t (4). here, urm,i
is the single relator of the upper presentation of the 2-bridge link group o... | 4 |
abstract—we propose an energy-efficient procedure for
transponder configuration in fmf-based elastic optical networks
in which quality of service and physical constraints are guaranteed and joint optimization of transmit optical power, temporal,
spatial and spectral variables are addressed. we use geometric
convexifica... | 7 |
abstract—in this paper, a new video classification
methodology is proposed which can be applied in both first and
third person videos. the main idea behind the proposed
strategy is to capture complementary information of
appearance and motion efficiently by performing two
independent streams on the videos. the first st... | 1 |
abstract—assignment of critical missions to unmanned aerial
vehicles (uav) is bound to widen the grounds for adversarial intentions in the cyber domain, potentially ranging from
disruption of command and control links to capture and use
of airborne nodes for kinetic attacks. ensuring the security
of electronic and comm... | 3 |
abstract | 7 |
abstract
the triad census is an important approach to understand local structure in network
science, providing comprehensive assessments of the observed relational configurations between triples of actors in a network. however, researchers are often interested
in combinations of relational and categorical nodal attribu... | 8 |
abstract
we propose several sampling architectures for the efficient acquisition of an ensemble of correlated
signals. we show that without prior knowledge of the correlation structure, each of our architectures
(under different sets of assumptions) can acquire the ensemble at a sub-nyquist rate. prior to sampling,
the... | 7 |
abstract. the extraction of fibers from dmri data typically produces a
large number of fibers, it is common to group fibers into bundles. to this
end, many specialized distance measures, such as mcp, have been used
for fiber similarity. however, these distance based approaches require
point-wise correspondence and focu... | 1 |
abstract
the slower is faster (sif) effect occurs when a system performs worse as its components try to do better. thus, a moderate individual efficiency actually leads to a
better systemic performance. the sif effect takes place in a variety of phenomena.
we review studies and examples of the sif effect in pedestrian ... | 9 |
abstract
let x be a negatively curved symmetric space and γ a non-cocompact lattice in isom(x). we show that
small, parabolic-preserving deformations of γ into the isometry group of any negatively curved symmetric
space containing x remain discrete and faithful (the cocompact case is due to guichard). this applies
in p... | 4 |
abstract feature, implying that our results may generalize to feature
selectivity, we do not examine feature selectivity in this work. | 2 |
abstract
the goal of this work is to extend the standard persistent homology pipeline for
exploratory data analysis to the 2-d persistence setting, in a practical, computationally
efficient way. to this end, we introduce rivet, a software tool for the visualization of
2-d persistence modules, and present mathematical f... | 0 |
abstract
in this paper, a new approach to solve the cubic b-spline curve fitting problem is
presented based on a meta-heuristic algorithm called “dolphin echolocation”. the
method minimizes the proximity error value of the selected nodes that measured
using the least squares method and the euclidean distance method of ... | 9 |
abstract
in the classic integer programming (ip) problem, the objective is to decide whether, for a
given m × n matrix a and an m-vector b = (b1 , . . . , bm ), there is a non-negative integer n-vector
x such that ax = b. solving (ip) is an important step in numerous algorithms and it is important
to obtain an understa... | 8 |
abstract. we prove that if γ is a lattice in the group of isometries of a symmetric space of non-compact type without euclidean
factors, then the virtual cohomological dimension of γ equals its
proper geometric dimension. | 4 |
abstract. we introduce the fractal expansions, sequences of integers associated to a number. these
can be used to characterize the o-sequences. we generalize them by introducing numerical functions
called fractal functions. we classify the hilbert functions of bigraded algebras by using fractal functions. | 0 |
abstract in this paper we introduce and analyse langevin samplers that consist of perturbations
of the standard underdamped langevin dynamics. the perturbed dynamics is such that its invariant
measure is the same as that of the unperturbed dynamics. we show that appropriate choices of the
perturbations can lead to samp... | 10 |
abstract—for homeland and transportation security applications, 2d x-ray explosive detection system (eds) have been
widely used, but they have limitations in recognizing 3d shape
of the hidden objects. among various types of 3d computed
tomography (ct) systems to address this issue, this paper is
interested in a statio... | 2 |
abstract
we consider the problem of nonparametric estimation of the drift of a continuously observed one-dimensional diffusion with periodic drift. motivated by computational considerations, van der meulen et al. (2014) defined a prior on the drift as a randomly truncated
and randomly scaled faber-schauder series expan... | 10 |
abstract
in the standard setting of approachability there are two players and a target set. the
players play repeatedly a known vector-valued game where the first player wants to have
the average vector-valued payoff converge to the target set which the other player tries to
exclude it from this set. we revisit this se... | 10 |
abstract
we propose expected policy gradients (epg), which unify stochastic policy gradients (spg)
and deterministic policy gradients (dpg) for reinforcement learning. inspired by expected
sarsa, epg integrates (or sums) across actions when estimating the gradient, instead of
relying only on the action in the sampled t... | 2 |
abstract
variational autoencoders (vaes) learn representations of data by jointly training a probabilistic
encoder and decoder network. typically these models encode all features of the data into a
single variable. here we are interested in learning disentangled representations that encode
distinct aspects of the data ... | 2 |
abstract
we study divided power structures on finitely generated k-algebras, where k is a field of positive characteristic p. as an application we show examples of 0-dimensional gorenstein k-schemes that do not lift
to a fixed noetherian local ring of non-equal characteristic. we also show that frobenius neighbourhoods... | 0 |
abstract
convolutional neural networks (cnns) are being applied to an increasing number of problems and fields due to their superior performance in classification and regression tasks. since two of the key
operations that cnns implement are convolution and pooling, this
type of networks is implicitly designed to act on... | 9 |
abstract | 8 |
abstract
hash tables are ubiquitous in computer science for efficient access
to large datasets. however, there is always a need for approaches that
offer compact memory utilisation without substantial degradation of
lookup performance. cuckoo hashing is an efficient technique of creating hash tables with high space uti... | 8 |
abstract classical
theories. in particular, we review theories which did not have any algorithmic content in their general natural framework, such as galois theory,
the dedekind rings, the finitely generated projective modules or the krull
dimension.
constructive algebra is actually an old discipline, developed among o... | 0 |
abstract—automated decision making systems are increasingly
being used in real-world applications. in these systems for the
most part, the decision rules are derived by minimizing the
training error on the available historical data. therefore, if
there is a bias related to a sensitive attribute such as gender,
race, re... | 7 |
abstract
this paper investigates the fundamental limits for detecting a high-dimensional sparse matrix
contaminated by white gaussian noise from both the statistical and computational perspectives.
we consider p×p matrices whose rows and columns are individually k-sparse. we provide a tight
characterization of the stat... | 7 |
abstract
person re-identification (reid) is an important task in
computer vision. recently, deep learning with a metric
learning loss has become a common framework for reid. in
this paper, we propose a new metric learning loss with hard
sample mining called margin smaple mining loss (msml)
which can achieve better accu... | 1 |
abstract
this paper introduces a novel activity dataset which exhibits real-life and diverse scenarios of complex, temporallyextended human activities and actions. the dataset presents a set of videos of actors performing everyday activities
in a natural and unscripted manner. the dataset was recorded using a static ki... | 1 |
abstract
the past few years have seen a surge of interest in the field of probabilistic logic learning
and statistical relational learning. in this endeavor, many probabilistic logics have been
developed. problog is a recent probabilistic extension of prolog motivated by the mining
of large biological networks. in prob... | 6 |
abstract: we consider a parameter estimation problem for one dimensional stochastic heat equations, when data is sampled discretely in time or spatial component. we establish some
general results on derivation of consistent and asymptotically normal estimators based
on computation of the p-variations of stochastic proc... | 10 |
abstract
interference arises when an individual’s potential outcome depends on the individual treatment level, but also on the treatment level of others. a common
assumption in the causal inference literature in the presence of interference is partial interference, implying that the population can be partitioned in clu... | 10 |
abstract
i introduce and analyse an anytime version of the optimally confident ucb
(ocucb) algorithm designed for minimising the cumulative regret in finitearmed stochastic bandits with subgaussian noise. the new algorithm is simple,
intuitive (in hindsight) and comes with the strongest finite-time regret guarantees
fo... | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.