The astonishing success of AlphaGo Zero\cite{Silver_AlphaGo} invokes a worldwide discussion of the future of our human society with a mixed mood of hope, anxiousness, excitement and fear. We try to dymystify AlphaGo Zero by a qualitative analysis to indicate that AlphaGo Zero can be understood as a specially structured…
New method improves solving NP-hard problems on graphs.
problem Solving combinatorial optimization problems on graphs.
method A novel reinforcement learning strategy based on AlphaGo Zero for graph embeddings.
result Our method generalizes better to various graphs than S2V-DQN.
During the development of AlphaGo, its many hyper-parameters were tuned with Bayesian optimization multiple times. This automatic tuning process resulted in substantial improvements in playing strength. For example, prior to the match with Lee Sedol, we tuned the latest AlphaGo agent and this improved its win-rate from…
The AlphaGo, AlphaGo Zero, and AlphaZero series of algorithms are remarkable demonstrations of deep reinforcement learning's capabilities, achieving superhuman performance in the complex game of Go with progressively increasing autonomy. However, many obstacles remain in the understanding of and usability of these prom…
A RL approach finds Nash equilibrium for turn-based zero-sum games.
problem Finding Nash equilibrium in two-player turn-based zero-sum games.
method EIS method combining exploration, policy improvement, and supervised learning.
result EIS method finds an ε-approximate value function of Nash equilibrium in O(ε^(-(d+4))) steps.
Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…
This paper presents a new meta-modeling framework to employ deep reinforcement learning (DRL) to generate mechanical constitutive models for interfaces. The constitutive models are conceptualized as information flow in directed graphs. The process of writing constitutive models are simplified as a sequence of forming g…
New method uses MCTS only at test time for faster game learning.
problem High computational demands in game learning.
method Combines MCTS with TD learning agents for faster, reproducible agents.
result First learning-from-scratch agent to beat Edax up to level 7.
Enhances PMD with lookahead to improve RL performance.
problem Improving RL performance with greedy policies over 1-step.
method Integrates multi-step greedy policies into PMD with lookahead.
result Shows faster convergence rate for h-PMD. Deep Reinforcement Learning (DRL) has become increasingly powerful in recent years, with notable achievements such as Deepmind's AlphaGo. It has been successfully deployed in commercial vehicles like Mobileye's path planning system. However, a vast majority of work on DRL is focused on toy examples in controlled synthe…
Achieving superhuman playing level by AlphaGo corroborated the capabilities of convolutional neural architectures (CNNs) for capturing complex spatial patterns. This result was to a great extent due to several analogies between Go board states and 2D images CNNs have been designed for, in particular translational invar…
While many recent advances in deep reinforcement learning (RL) rely on model-free methods, model-based approaches remain an alluring prospect for their potential to exploit unsupervised data to learn environment model. In this work, we provide an extensive study on the design of deep generative models for RL environmen…
This paper applies DRL to mean reversion trading problems.
problem Adopting DRL for financial trading problems.
method Integrates function properties into DRL for mean reversion trading.
result Demonstrates a highly-performant DRL solution for financial decision-making.
Multiplayer Online Battle Arena (MOBA) is currently one of the most popular genres of digital games around the world. The domain of knowledge contained in these complicated games is large. It is hard for humans and algorithms to evaluate the real-time game situation or predict the game result. In this paper, we introdu…
In statistical modelling the biggest threat is concept drift which makes the model gradually showing deteriorating performance over time. There are state of the art methodologies to detect the impact of concept drift, however general strategy considered to overcome the issue in performance is to rebuild or re-calibrate…
Optimizes regret distribution in stochastic bandits for risk balance.
problem Balancing regret expectation and tail risk in stochastic bandits.
method Characterizes optimal regret tail probability for any threshold, proposes new policies.
result Discovers an intrinsic gap in optimal tail rate based on time horizon uncertainty.
Proposes a method to handle sparse multiway count data with false zeros using zero-truncated Poisson regression.
problem Handling sparse multiway count data corrupted by false zeros.
method Zero-truncated Poisson regression with tensor completion.
result Accurate estimation of multiway count data from approximately IR2log22(I) non-zero counts. In finance, durations between successive transactions are usually modeled by the autoregressive conditional duration model based on a continuous distribution omitting zero values. Zero or close-to-zero durations can be caused by either split transactions or independent transactions. We propose a discrete model allowing…
ZeroS improves Transformers by adding negative weights, matching or beating softmax attention.
problem Limited performance of linear attention methods, especially in long context sequences.
method Proposes Zero-Sum Linear Attention (ZeroS) that removes the zero-order term and reweights zero-sum softmax residuals.
result ZeroS matches or exceeds standard softmax attention across various benchmarks, theoretically expanding representable functions.
The paper proves conditions for zero Gaussian curvature convex hypersurfaces to be hyperplanes.
problem Conditions for zero Gaussian curvature convex hypersurfaces to be hyperplanes.
method Proving Bernstein type theorems for entire convex graphical hypersurfaces with zero Gaussian curvature in Euclidean and Minkowski contexts.
result Zero Gaussian curvature convex hypersurfaces must be hyperplanes if the mean curvature goes to zero at infinity.
Study improves variance calculation for random zero sets on complex manifolds.
problem Improving the variance calculation for random zero sets on complex manifolds.
method Deriving an asymptotic expansion for the variance of linear statistics of zero divisors of random holomorphic sections.
result Sharpens leading-order asymptotics for the variance of random zero sets.
Study complete gradient Ricci solitons with zero radial Weyl curvature.
problem Characterize complete gradient Ricci solitons with specific curvature properties.
method Classify complete gradient Ricci solitons with zero radial Weyl curvature for dimensions n≥4. result Completely classified complete gradient Ricci solitons with zero radial Weyl curvature.
The paper connects bundle curvature to random zero currents.
problem Understanding the relationship between bundle curvature and random zero currents.
method Heat flow on Hermitian line bundles over Riemannian manifolds.
result Random zero currents connect bundle curvature to ground state zero current.
Zero-inflated datasets, which have an excess of zero outputs, are commonly encountered in problems such as climate or rare event modelling. Conventional machine learning approaches tend to overestimate the non-zeros leading to poor performance. We propose a novel model family of zero-inflated Gaussian processes (ZiGP) …
Zero-shot anomaly detection method using batch normalization.
problem Adapting anomaly detectors to new normal data distributions without training data.
method Adaptive Centered Representations (ACR) with batch normalization.
result First zero-shot AD results for tabular data and image data.
Modified model prevents volatility from approaching zero.
problem Volatility in the Gatheral model can approach zero, making it statistically indistinguishable.
method Proposed a modified model with Skorokhod reflection to prevent volatility from approaching zero.
result The modified model prevents volatility from approaching zero, preserving the model's flexibility.
Exact relationships found between ATM slope, volatility swap, and zero vanna.
problem Understanding relationships between implied volatilities and swaps.
method Analyzes exact relationships between ATM slope, volatility swap, and zero vanna.
result Exact relationships between ATM slope, volatility swap, and zero vanna.
Study duality of zero mean curvature surfaces in Heisenberg group.
problem Understanding the duality of zero mean curvature surfaces in the Lorentzian Heisenberg group.
method Investigation of a transformation surface associated with zero mean curvature surfaces in the Heisenberg group under two metrics.
result Derivation of the Sym formula for the dual surface in both metric cases.
Classifies surfaces with zero mean curvature in a light cone.
problem Classifying surfaces with zero mean curvature in a light cone.
method Examined geodesics and screw motions, used Weierstrass representations.
result Complete classification of ruled zero mean curvature surfaces.
Solves surface problem in 3D light cone.
problem Björling problem for zero mean curvature surfaces in the three-dimensional light cone.
method Solves the Björling problem for zero mean curvature surfaces in the three-dimensional light cone.
result Constructs and classifies all rotational zero mean curvature surfaces.
Paper derives formulas for volatility swap strike and zero vanna implied volatility.
problem Relationship between volatility swap strike and zero vanna implied volatility.
method Applied Malliavin calculus to derive exact formulas.
result Zero vanna implied volatility is a better approximation for volatility swap strike.
New examples of mixed-type zero-curvature graphs found.
problem Finding new examples of zero-curvature graphs in Lorentz-Minkowski space.
method Using Konderak's representation formula to construct entire zero-curvature graphs over specific planes.
result Existence of new types of entire zero-curvature graphs in mixed-type in Lorentz-Minkowski space.
We first construct a genus zero positive allowable Lefschetz fibration over the disk (a genus zero PALF for short) on the Akbulut cork and describe the monodromy as a positive factorization in the mapping class group of a surface of genus zero with five boundary components. We then construct genus zero PALFs on infinit…
A new model synthesizes population with fewer structural and sampling zeros.
problem Synthesizing a feasible and diverse synthetic population from limited data.
method A deep generative model with two regularizations to minimize structural zeros and preserve sampling zeros.
result The model significantly improves feasibility and diversity of synthetic populations.
Study finds financial constraints explain zero-leverage firms.
problem Why some firms have zero leverage despite various explanations.
method Examined three measures of financial constraints; analyzed firms' behavior before and after levering.
result Firms are financially constrained, not due to managerial entrenchment or market valuation.
MARGINATTACK improves zero-confidence adversarial attacks' accuracy and efficiency.
problem Improving zero-confidence adversarial attacks' accuracy and efficiency.
method Proposes MARGINATTACK, a zero-confidence attack framework that computes margin with improved accuracy and efficiency.
result MARGINATTACK computes a smaller margin than state-of-the-art zero-confidence attacks and matches state-of-the-art fix-perturbation attacks.
Paper proposes copula-based models for analyzing multivariate zero-inflated continuous data.
problem Challenges in analyzing multivariate zero-inflated continuous data with mixed discreteness and continuity.
method Proposes two copula-based density estimation models and rectified Gaussian copula.
result Demonstrates superior performance compared to conventional methods.
Paper introduces ZIPTF and C-ZIPTF for better tensor factorization of zero-inflated count data.
problem Inefficient tensor factorization for zero-inflated count data, especially in scRNA-seq.
method Zero Inflated Poisson Tensor Factorization (ZIPTF) and Consensus Zero Inflated Poisson Tensor Factorization (C-ZIPTF).
result ZIPTF and C-ZIPTF improve tensor factorization accuracy and consistency for zero-inflated count data.
Paper proposes redundancy-free features for zero-shot object recognition.
problem Redundant visual features degrade zero-shot object recognition.
method Project original features into a new, statistically independent space.
result RFF-GZSL achieves competitive results on benchmark datasets.
New ZIPLN model accounts for zero-inflation in multivariate count data.
problem Zero-inflation in multivariate count data.
method Introduced Zero-Inflated PLN (ZIPLN) model with variational inference.
result ZIPLN significantly improves log-likelihood and reduces dispersion.
Study classifies zero mean curvature surfaces with planar curvature lines.
problem Characterizing surfaces with specific curvature properties.
method Complete classification and investigation of their relationship to Thomsen-type surfaces.
result Zero mean curvature surfaces with planar curvature lines belong to a 1-parameter family.
Study on zeros of Gaussian sections on semipositive line bundles on punctured Riemann surfaces.
problem Distribution of zeros of Gaussian sections on semipositive line bundles.
method Analysis of Bergman kernels and random zeros in high tensor powers.
result Equidistribution, large deviation estimates, central limit theorem, and number variances for zeros in the semi-classical limit.
The paper calculates area Siegel--Veech constants for specific submanifolds of REL zero.
problem Calculating area Siegel--Veech constants for affine invariant submanifolds of REL zero.
method Using volumes of the principal boundary strata and intersection theory.
result Proves a conjectural formula for the area Siegel--Veech constant in the case of REL zero.
Zero-shot learning transfers knowledge from seen classes to novel unseen classes to reduce human labor of labelling data for building new classifiers. Much effort on zero-shot learning however has focused on the standard multi-class setting, the more challenging multi-label zero-shot problem has received limited attent…
Zero loss is achievable in overparametrized DL networks under specific conditions.
problem Achieving zero loss in overparametrized deep learning networks.
method Determine sufficient conditions for zero loss attainability and present an explicit construction of zero loss minimizers.
result Explicit minimizers for zero loss in overparametrized DL networks are constructed without gradient descent.
Paper investigates reflection principles for zero mean curvature surfaces in isotropic 3-space.
problem Investigating reflection principles for zero mean curvature surfaces in isotropic 3-space.
method Analyzes reflection principles for zero mean curvature surfaces in I3. result Shows a reflection principle for isotropic line segments on zero mean curvature surfaces in I3. Paper explores zero-shot cross-lingual reading comprehension using pre-trained multi-lingual model.
problem Lack of training data for every language in reading comprehension tasks.
method Systematic exploration of zero-shot cross-lingual transfer learning with a multi-lingual language representation model.
result Zero-shot cross-lingual transfer learning is feasible and translating source data into target language is not necessary.
The aim of the paper is to investigate the relation between inverse limit of branched manifolds and codimension zero laminations. We give necessary and sufficient conditions for such an inverse limit to be a lamination. We also show that codimension zero laminations are inverse limits of branched manifolds. The inverse…