TossingBot learns to throw objects accurately with residual physics.
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.
Trend · papers per month
Throwing away data can improve worst-group error in imbalanced datasets.
For strong exact magnetic fields the action functional (i.e., the length plus the linear magnetic term) is not bounded from below on the space of closed contractible curves and the lower estimates for critical levels are derived by using the principle of throwing out cycles. It is proved that for almost every energy le…
Data describing historical economic growth are analysed. Included in the analysis is the world and regional economic growth. The analysis demonstrates that historical economic growth had a natural tendency to follow hyperbolic distributions. Parameters describing hyperbolic distributions have been determined. A search …
Learning algorithms are enabling robots to solve increasingly challenging real-world tasks. These approaches often rely on demonstrations and reproduce the behavior shown. Unexpected changes in the environment may require using different behaviors to achieve the same effect, for instance to reach and grasp an object in…
We study a simple model of an asset market with informed and non-informed agents. In the absence of non-informed agents, the market becomes information efficient when the number of traders with different private information is large enough. Upon introducing non-informed agents, we find that the latter contribute signif…
We define homotopy-theoretic invariants of knots in prime 3-manifolds. Fix a knot J in a prime 3-manifold M. Call a knot K in M concordant to J if it cobounds a properly embedded annulus with J in MxI, and call K J-characteristic if there is a degree-one map f:M --> M throwing K onto J and mapping M-K to M-J. These inv…
We introduce a method for constructing skills capable of solving tasks drawn from a distribution of parameterized reinforcement learning problems. The method draws example tasks from a distribution of interest and uses the corresponding learned policies to estimate the topology of the lower-dimensional piecewise-smooth…
Clarifies model-based RL's theoretical issues and counterexamples for popular losses.
We study the moduli spaces of flat SL(r)- and PGL(r)-connections, or equivalently, Higgs bundles, on an algebraic curve. These spaces are noncompact Calabi-Yau orbifolds; we show that they can be regarded as mirror partners in two different senses. First, they satisfy the requirements laid down by Strominger-Yau-Zaslow…
An absolute parallelism (AP-) space having Finslerian properties is called FAP-space. This FAP-structure is more wider than both conventional AP and Finsler structures. In the present work, more geometric objects as curvature and torsion tensors are derived in the context of this structure. Also second order tensors, u…
By studying the group of rigid motions, , in the 3D-Heisenberg group , we define the density and the measure for the sets of horizontal lines. We show that the volume of a convex domain is equal to the integral of length of chord over all horizontal lines intersecting . As the classical r…
The Jacobi-Maupertuis metric allows one to reformulate Newton's equations as geodesic equations for a Riemannian metric which degenerates at the Hill boundary. We prove that a JM geodesic which comes sufficiently close to a regular point of the boundary contains pairs of conjugate points close to the boundary. We prove…
3-quasi-Sasakian manifolds were studied systematically by the authors in a recent paper as a suitable setting unifying 3-Sasakian and 3-cosymplectic geometries. This paper throws new light on their geometric structure which reveals to be generally richer compared to the 3-Sasakian subclass. In fact, it turns out that t…
Robotic table tennis learns efficient policies to return balls at 100Hz.
Random investment strategies outperform sensible ones, even with forecasts.
Scarce data is a major challenge to scaling robot learning to truly complex tasks, as we need to generalize locally learned policies over different "contexts". Bayesian optimization approaches to contextual policy search (CPS) offer data-efficient policy learning that generalize over a context space. We propose to impr…
In mixture model-based clustering applications, it is common to fit several models from a family and report clustering results from only the `best' one. In such circumstances, selection of this best model is achieved using a model selection criterion, most often the Bayesian information criterion. Rather than throw awa…
We study the nature of fluctuations in variety of price indices involving companies listed on the New York Stock Exchange. The fluctuations at multiple scales are extracted through the use of wavelets belonging to Daubechies basis. The fact that these basis sets satisfy vanishing moments conditions makes them ideal to …
Beam search improves UQ in LLMs by reducing duplicates and variance.
QFDA combines machine learning and information theory for image classification.
New algorithm combines curriculum learning with HER for complex object manipulation tasks.
Paper improves Oja's algorithm for Markovian data streams.
A simple modification improves GAN performance by discarding bad samples.
Bayesian optimization for contextual policy search improves robot learning.
FAVAE learns disentangled representations from sequential data.
Study finds many stocks in S&P 500 are inefficient, suggesting financial analysts outperform blindfolded monkeys.
Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network's large-scale …
Improved diffusion models solve inverse problems more accurately by correcting sample paths off the data manifold.
Study reconstructs Faber-Schauder coefficients from antiderivative observations.
PsychFM predicts individual gambling choices using psychological and machine learning models.
A new model for latent class analysis with weighted responses.
New method controls bias in training data for fair outcomes.
Lossy compression and clustering fundamentally involve a decision about what features are relevant and which are not. The information bottleneck method (IB) by Tishby, Pereira, and Bialek formalized this notion as an information-theoretic optimization problem and proposed an optimal tradeoff between throwing away as ma…
Paper introduces impact curves for evaluating binarized regression models with varying costs.
Given a real vector space V of finite dimension, together with a particular homogeneous field of bivectors that we call a "field of projective forces", we define a law of dynamics such that the position of the particle is a "ray" i.e. a half-line drawn from the origin of V. The impulsion is a bivector whose support is …
System identifies high impact research from academic papers.
Deep gated networks help understand training and generalization in deep learning.
There is no doubt that both the special and general theories of relativity capture the imagination. The anti-intuitive properties of the special theory of relativity and its deep philosophical implications, the bizzare and dazzling predictions of the general theory of relativity: the curvature of spacetime, the exotic …
Paper explores limitations of generative models in finance, proposing a new method for portfolio generation.
Study complex structures with perturbed differential operators to compute curvature-like operators and obtain vanishing results.
Proposes a new method to selectively access privileged information in reinforcement learning.
Paper proposes using unlabeled data for fair decision-making.