Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

8162432 · Feb 202019922001200920172026
48 results for ETC

ETC learns minimal representations for reinforcement learning in POMDPs.

problem Sample complexity challenges in reinforcement learning for POMDPs.
method ETC learns low-dimensional features and embeddings at two levels, optimizing policy.
result ETC achieves polynomial sample complexity for POMDPs with low-rank transition kernels.

In this note we compare two recently proposed semidefinite relaxations for the sparse linear regression problem by Pilanci, Wainwright and El Ghaoui (Sparse learning via boolean relaxations, 2015) and Dong, Chen and Linderoth (Relaxation vs. Regularization A conic optimization perspective of statistical variable select…

2016-03-15abs ↗pdf ↗

Extends spectral Einstein functionals computation to 4D spin manifolds with boundary.

problem Computing spectral Einstein functionals for 4D spin manifolds with boundary.
method Generalizes Dabrowski's results to 4D spin manifolds with boundary using noncommutative residue.
result Generalized spectral Einstein functionals computation for 4D spin manifolds with boundary.

We discuss here researches on econophysics done from India in the last two decades. The term `econophysics' was formally coined in India (Kolkata) in 1995. Since then many research papers, books, reviews, etc. have been written by scientists. Many institutions are now involved in this research field and many conference…

2013-07-29abs ↗pdf ↗

In this paper will be applied some principles and methods from econophysics in the case of the direct foreign investitions (D.F.I.), particularised for the Greenfield type, and mixed firms of trade and industrial production (Joint Ventures). To this aim will be used some similarities and parallelisms between the mentio…

2011-01-24abs ↗pdf ↗

Paper proposes DG-ETC for online submodular maximization with stochastic bandit feedback.

problem Online unconstrained submodular maximization with stochastic bandit feedback.
method Double-Greedy - Explore-then-Commit (DG-ETC) approach.
result DG-ETC achieves logarithmic regret O(dlog(dT))O(d\log(dT)) for 1/21/2-approximate pseudo-regret.

Knowing and modelling the migration phenomena and especially the social and economic consequences have a theoretical and practical importance, being related to their consequences for development, economic progress (or as appropriate, regression), environmental influences etc. One of the causes of migration, especially …

2012-02-05abs ↗pdf ↗

The study shows manifolds with special generic maps also have nice multisections.

problem Characterizing manifolds with special generic maps and multisections.
method Analyzing manifolds with special generic maps and their properties, and showing how these maps restrict the differentiable structures of spheres and manifolds.
result Manifolds admitting special generic maps also admit nice generalized multisections.

We review the main "omnibus procedures" for goodness-of-fit testing for copulas: tests based on the empirical copula process, on probability integral transformations, on Kendall's dependence function, etc, and some corresponding reductions of dimension techniques. The problems of finding asymptotic distribution-free te…

2012-11-19abs ↗pdf ↗

Some of the most important classes of surfaces in projective 3-space are reviewed: these are isothermally asymptotic surfaces, projectively applicable surfaces, surfaces of Jonas, projectively minimal surfaces, etc. It is demonstrated that the corresponding projective "Gauss-Codazzi" equations reduce to integrable syst…

1999-03-25abs ↗pdf ↗

This paper extends Dabrowski-Sitarz-Zalecki theorems to manifolds with boundary.

problem Generalizing theorems to manifolds with boundary.
method Extending results of Dabrowski etc. to 4D oriented Riemannian manifolds with boundary.
result Proof of Dabrowski-Sitarz-Zalecki type theorems for manifolds with boundary.

Estimating the intensity of emotion has gained significance as modern textual inputs in potential applications like social media, e-retail markets, psychology, advertisements etc., carry a lot of emotions, feelings, expressions along with its meaning. However, the approaches of traditional sentiment analysis primarily …

2019-03-20abs ↗pdf ↗

We study the multi-armed bandit problem with subgaussian rewards. The explore-then-commit (ETC) strategy, which consists of an exploration phase followed by an exploitation phase, is one of the most widely used algorithms in a variety of online decision applications. Nevertheless, it has been shown in Garivier et al. (…

2020-02-21abs ↗pdf ↗

Multi-modal data comprising imaging (MRI, fMRI, PET, etc.) and non-imaging (clinical test, demographics, etc.) data can be collected together and used for disease prediction. Such diverse data gives complementary information about the patientś condition to make an informed diagnosis. A model capable of leveraging the i…

2018-12-24abs ↗pdf ↗

Since the discovery of differential calculus by Newton and Leibniz and the subsequent continuous growth of its applications to physics, mechanics, geometry, etc, it was observed that partial derivatives in the study of various natural problems are (self-)organized in certain structures usually called geometric. Tensors…

2015-11-21abs ↗pdf ↗

Model predicts travel time under rare conditions using a vector-space model.

problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.

The 2-bridge knots are a family of knots with bridge number 2. In this paper, we compute the Kauffman polynomials of 2-bridge knots using the Kauffman skein theory and linear algebra techniques. Our calculation can be easily carried out using Mathematica, Maple, Mathcad, etc.

2006-06-05abs ↗pdf ↗

We investigate contact Lie groups having a left invariant Riemannian or pseudo-Riemannian metric with specific properties such as being bi-invariant, flat, negatively curved, Einstein, etc. We classify some of such contact Lie groups and derive some obstruction results to the existence of left invariant contact structu…

2014-02-20abs ↗pdf ↗

Simpler GNNs with low-rank non-parametric aggregators perform well on graph benchmarks.

problem Over-engineering in GNN architectures for common semi-supervised node classification datasets.
method Replacing feature aggregation with a non-parametric learner to streamline GNN design.
result Non-parametric regression is effective for semi-supervised learning on sparse, directed networks.

We find explicit subdivision rules for all special cubulated groups. A subdivision rule for a group produces a sequence of tilings on a sphere which encode all quasi-isometric information for a group. We show how these tilings detect properties such as growth, ends, divergence, etc. We include figures of several worked…

2013-07-06abs ↗pdf ↗

In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or semi-Pfaffian cases, which depend only on the combinatoric data representing the objects…

2012-04-25abs ↗pdf ↗

This work concerns the definition and analysis of a new class of Lie systems on Poisson manifolds enjoying rich geometric features: the Lie--Hamilton systems. We devise methods to study their superposition rules, time independent constants of motion and Lie symmetries, linearisability conditions, etc. Our results are i…

2012-11-29abs ↗pdf ↗

Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…

2018-11-13abs ↗pdf ↗

We study the robustness to symmetric label noise of GNNs training procedures. By combining the nonlinear neural message-passing models (e.g. Graph Isomorphism Networks, GraphSAGE, etc.) with loss correction methods, we present a noise-tolerant approach for the graph classification task. Our experiments show that test a…

2019-05-05abs ↗pdf ↗

We show a natural relation between the monodromy formula for focus-focus singularities of integrable Hamiltonian systems and a formula of Duistermaat-Heckman, and extend the main results of our previous note on focus-focus singularities ($\bbS^1$-action, monodromy, and topological classification) to the degenerate case…

2001-10-14abs ↗pdf ↗

New algorithm tackles high-dimensional contextual bandits without sparsity.

problem High-dimensional linear contextual bandit problem with large feature space.
method Proposes explore-then-commit (EtC) and adaptive explore-then-commit (AEtC) algorithms.
result Derives optimal rate for ETC algorithm and shows adaptive AEtC achieves it.

Convolutional and Recurrent, deep neural networks have been successful in machine learning systems for computer vision, reinforcement learning, and other allied fields. However, the robustness of such neural networks is seldom apprised, especially after high classification accuracy has been attained. In this paper, we …

2018-04-30abs ↗pdf ↗

We present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations. As applications, we present explicit descriptions of the triality automorphism of Spin(8)Spin(8), explicit representations…

2019-05-25abs ↗pdf ↗

Locality sensitive hashing (LSH) is a powerful tool for sublinear-time approximate nearest neighbor search, and a variety of hashing schemes have been proposed for different dissimilarity measures. However, hash codes significantly depend on the dissimilarity, which prohibits users from adjusting the dissimilarity at q…

2016-09-11abs ↗pdf ↗

We define a class of geometric flows on a complete Kähler manifold to unify some physical and mechanical models such as the motion equations of vortex filament, complex-valued mKdV equations, derivative nonlinear Schrödinger equations etc. Furthermore, we consider the existence for these flows from S1S^1 into a complet…

2012-03-02abs ↗pdf ↗