Existing table question answering datasets contain abundant factual questions that primarily evaluate the query and schema comprehension capability of a system, but they fail to include questions that require complex reasoning and integration of information due to the constraint of the associated short-form answers. To address these issues and to demonstrate the full challenge of table question answering, we introduce FeTaQA, a new dataset with 10K Wikipedia-based {table, question, free-form answer, supporting table cells} pairs. FeTaQA yields a more challenging table question answering setting because it requires generating free-form text answers after retrieval, inference, and integration of multiple discontinuous facts from a structured knowledge source. Unlike datasets of generative QA over text in which answers are prevalent with copies of short text spans from the source, answers in our dataset are human-generated explanations involving entities and their high-level relations. We provide two benchmark methods for the proposed task: a pipeline method based on semantic-parsing-based QA systems and an end-to-end method based on large pretrained text generation models, and show that FeTaQA poses a challenge for both methods.
As we rely on machine learning (ML) models to make more consequential decisions, the issue of ML models perpetuating or even exacerbating undesirable historical biases (e.g., gender and racial biases) has come to the fore of the public's attention. In this paper, we focus on the problem of detecting violations of individual fairness in ML models. We formalize the problem as measuring the susceptibility of ML models against a form of adversarial attack and develop a suite of inference tools for the adversarial cost function. The tools allow auditors to assess the individual fairness of ML models in a statistically-principled way: form confidence intervals for the worst-case performance differential between similar individuals and test hypotheses of model fairness with (asymptotic) non-coverage/Type I error rate control. We demonstrate the utility of our tools in a real-world case study.
3D object grounding aims to locate the most relevant target object in a raw point cloud scene based on a free-form language description. Understanding complex and diverse descriptions, and lifting them directly to a point cloud is a new and challenging topic due to the irregular and sparse nature of point clouds. There are three main challenges in 3D object grounding: to find the main focus in the complex and diverse description; to understand the point cloud scene; and to locate the target object. In this paper, we address all three challenges. Firstly, we propose a language scene graph module to capture the rich structure and long-distance phrase correlations. Secondly, we introduce a multi-level 3D proposal relation graph module to extract the object-object and object-scene co-occurrence relationships, and strengthen the visual features of the initial proposals. Lastly, we develop a description guided 3D visual graph module to encode global contexts of phrases and proposals by a nodes matching strategy. Extensive experiments on challenging benchmark datasets (ScanRefer and Nr3D) show that our algorithm outperforms existing state-of-the-art. Our code is available at https://github.com/PNXD/FFL-3DOG.
A large proportion of market making models derive from the seminal model of Avellaneda and Stoikov. The numerical approximation of the value function and the optimal quotes in these models remains a challenge when the number of assets is large. In this article, we propose closed-form approximations for the value functions of many multi-asset extensions of the Avellaneda-Stoikov model. These approximations or proxies can be used (i) as heuristic evaluation functions, (ii) as initial value functions in reinforcement learning algorithms, and/or (iii) directly to design quoting strategies through a greedy approach. Regarding the latter, our results lead to new and easily interpretable closed-form approximations for the optimal quotes, both in the finite-horizon case and in the asymptotic (ergodic) regime.
The metalog distributions represent a convenient way to approach many practical applications. Their distinctive feature is simple closed-form expressions for quantile functions. This paper contributes to further development of the metalog distributions by deriving the closed-form expressions for the Conditional Value at Risk, a risk measure that is closely related to the tail conditional expectations. It also addressed the derivation of the first-order partial moments and shows that they are convex with respect to the vector of the metalog distribution parameters.
This paper explores when the financial market lost the price formation function in prewar Japan in the sense of Fama's (1970) semi-strong form market efficiency using a new dataset. We particularly focus on the relationship between the prewar Japanese financial market and several government policy interventions to explore whether the semi-strong form market efficiency evolves over time. To capture the long-run impact of government policy interventions against the markets, we measure the time-varying joint degree of market efficiency and the time-varying impulse responses based on Ito et al.'s (2014; 2017) generalized least squares-based time-varying vector autoregressive model. The empirical results reveal that (1) the joint degree of market efficiency in the prewar Japanese financial market fluctuated over time because of external events such as policy changes and wars, (2) the semi-strong form EMH is almost supported in the prewar Japanese financial market, (3) Lo's (2004) adaptive market hypothesis is supported in the prewar Japanese financial market even if we consider that the public information affects the financial markets, and (4) the prewar Japanese financial markets lost the price formation function in 1932 and that was a turning point in the market.
We provide closed-form pricing formulas for a wide variety of path-independent options, in the exponential L\'evy model driven by the Normal inverse Gaussian process. The results are obtained in both the symmetric and asymmetric model, and take the form of simple and quickly convergent series, under some condition involving the log-forward moneyness and the maturity of instruments. Proofs are based on a factorized representation in the Mellin space for the price of an arbitrary path-independent payoff, and on tools from complex analysis. The validity of the results is assessed thanks to several comparisons with standard numerical methods (Fourier and Fast Fourier transforms, Monte-Carlo simulations) for realistic sets of parameters. Precise bounds for the convergence speed and the truncation error are also provided.
The efficiency of the stock market has a significant impact on the potential return on investment. An efficient market eliminates the possibility of arbitrage and unexploited profit opportunities. This study analyzes the weak form efficiency of the Indian Stock market based on the two major Indian stock exchanges, viz., BSE and NSE. The daily closing values of Sensex and Nifty indices for the period from April 2010 to March 2019 are used to perform the Runs test, the Autocorrelation test, and the Autoregression test. The study confirms that the Indian Stock market is weak form inefficient and can thus be outperformed.
In this paper we derive a efficient Monte Carlo approximation for the price of path-dependent derivatives under the multiscale stochastic volatility models of Fouque \textit{et al}. Using the formulation of this pricing problem under the functional It\^o calculus framework and making use of Greek formulas from Malliavin calculus, we derive a representation for the first-order approximation of the price of path-dependent derivatives in the form $\mathbb{E}[\mbox{payoff} \times \mbox{weight}]$. The weight is known in closed form and depends only on the group market parameters arising from the calibration of the multiscale stochastic volatility to the market's implied volatility. Moreover, only simulations of the Black-Scholes model is required. We exemplify the method for a couple path-dependent derivatives.
We develop an analytic model of the mammalian cochlea. We use a mixed physical-phenomenological approach by utilizing existing work on the physics of classical box-representations of the cochlea, and behavior of recent data-derived wavenumber estimates. Spatial variation is incorporated through a single independent variable that combines space and frequency. We arrive at closed-form expressions for the organ of Corti velocity, its impedance, the pressure difference across the organ of Corti, and its wavenumber. We perform model tests using real and imaginary parts of chinchilla data from multiple locations and for multiple variables. The model also predicts impedances that are qualitatively consistent with current literature. For implementation, the model can leverage existing efforts for both filter bank and filter cascade models that target improved algorithmic or analog circuit efficiencies. The simplicity of the cochlear model, its small number of model constants, its ability to capture the variation of tuning, its closed-form expressions for physically-interrelated variables, and the form of these expressions that allows for easily determining one variable from another make the model appropriate for analytic and digital auditory filter implementations as discussed here, as well as for extracting macromechanical insights regarding how the cochlea works.
In this paper, incremental decode-and-forward (IDF) and incremental selective decode-and-forward (ISDF) relaying are proposed to improve the spectral efficiency of power line communication. Contrary to the traditional decode-and-forward (DF) relaying, IDF and ISDF strategies utilize the relay only if the direct link ceases to attain a certain information rate, thereby improving the spectral efficiency. The path gain through the power line is assumed to be log-normally distributed with high distance-dependent attenuation and the additive noise is from a Bernoulli-Gaussian process. Closed-form expressions for the outage probability, and approximate closed-form expressions for the end-to-end average channel capacity and the average bit error rate for binary phase-shift keying are derived. Furthermore, a closed-form expression for the fraction of times the relay is in use is derived as a measure of the spectral efficiency. Comparative analysis of IDF and ISDF with traditional DF relaying is presented. It is shown that IDF is a specific case of ISDF and can obtain optimal spectral efficiency without compromising the outage performance. By employing power allocation to minimize the outage probability, it is realized that the power should be allocated in accordance with the inter-node distances and channel parameters.
It is an essential technique for the moving user nodes (UNs) with clock offset and clock skew to resolve the joint localization and synchronization (JLAS) problem. Existing iterative maximum likelihood methods using sequential one-way time-of-arrival (TOA) measurements from the anchor nodes' (AN) broadcast signals require a good initial guess and have a computational complexity that grows with the number of iterations, given the size of the problem. In this paper, we propose a new closed-form JLAS approach, namely CFJLAS, which achieves the asymptotically optimal solution in one shot without initialization when the noise is small, and has a low computational complexity. After squaring and differencing the sequential TOA measurement equations, we devise two intermediate variables to reparameterize the non-linear problem. In this way, we convert the problem to a simpler one of solving two simultaneous quadratic equations. We then solve the equations analytically to obtain a raw closed-form JLAS estimation. Finally, we apply a weighted least squares (WLS) step to optimize the estimation. We derive the Cramer-Rao lower bound (CRLB), analyze the estimation error, and show that the estimation accuracy of the CFJLAS reaches the CRLB under the small noise condition. The complexity of the new CFJLAS is only determined by the size of the problem, unlike the conventional iterative method, whose complexity is additionally multiplied by the number of iterations. Simulations in a 2D scene verify that the estimation accuracies of the new CFJLAS method in position, velocity, clock offset, and clock skew all reach the CRLB under the small noise condition. Compared with the conventional iterative method, the proposed new CFJLAS method does not require initialization, obtains the optimal solution under the small noise condition, and has a low computational complexity.
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available to match at the same time, one must establish which agents are allowed to form blocking pairs. Second, dynamic matching markets exhibit a form of externality that is not present in static markets: an agent's payoff from remaining unmatched cannot be defined independently of what other contemporaneous agents' outcomes are. Dynamically stable matchings always exist. Dynamic stability is a necessary condition to ensure timely participation in the economy by ensuring that agents do not strategically delay the time at which they are available to match.
Communicating cells can coordinate their gene expressions to form spatial patterns. 'Secrete-and-sense cells' secrete and sense the same molecule to do so and are ubiquitous. Here we address why and how these cells, from disordered beginnings, can form spatial order through a statistical mechanics-type framework for cellular communication. Classifying cellular lattices by 'macrostate' variables - 'spatial order paramete' and average gene-expression level - reveals a conceptual picture: cellular lattices act as particles rolling down on 'pseudo-energy landscapes' shaped by a 'Hamiltonian' for cellular communication. Particles rolling down represent cells' spatial order increasing. Particles trapped on the landscapes represent metastable spatial configurations. The gradient of the Hamiltonian and a 'trapping probability' determine the particle's equation of motion. This framework is extendable to more complex forms of cellular communication.
We propose a counterexample-guided inductive synthesis framework for the formal synthesis of closed-form sampled-data controllers for nonlinear systems to meet STL specifications over finite-time trajectories. Rather than stating the STL specification for a single initial condition, we consider an (infinite and bounded) set of initial conditions. Candidate solutions are proposed using genetic programming, which evolves controllers based on a finite number of simulations. Subsequently, the best candidate is verified using reachability analysis; if the candidate solution does not satisfy the specification, an initial condition violating the specification is extracted as a counterexample. Based on this counterexample, candidate solutions are refined until eventually a solution is found (or a user-specified number of iterations is met). The resulting sampled-data controller is expressed as a closed-form expression, enabling both interpretability and the implementation in embedded hardware with limited memory and computation power. The effectiveness of our approach is demonstrated for multiple systems.
We provide two closed-form geodesic formulas for a family of metrics on Stiefel manifold, parameterized by two positive numbers, having both the embedded and canonical metrics as special cases. The closed-form formulas allow us to compute geodesics by matrix exponential in reduced dimension for low-rank manifolds. Combining with the use of Fr{\'e}chet derivatives to compute the gradient of the square Frobenius distance between a geodesic ending point to a given point on the manifold, we show the logarithm map and geodesic distance between two endpoints on the manifold could be computed by {\it minimizing} this square distance by a {\it trust-region} solver. This leads to a new framework to compute the geodesic distance for manifolds with known geodesic formula but no closed-form logarithm map. We show the approach works well for Stiefel as well as flag manifolds. The logarithm map could be used to compute the Riemannian center of mass for these manifolds equipped with the above metrics. We also deduce simple trigonometric formulas for the Riemannian exponential and logarithm maps on the Grassmann manifold.
Mechanochemical models of pattern formation in biological tissues have been used to study a variety of biomedical systems and describe the physical interactions between cells and their local surroundings. These models generally consist of a balance equation for the cell density, one for the density of the extracellular matrix (ECM), and a force-balance equation describing the mechanical equilibrium of the cell-ECM system. Assuming this system can be regarded as an isotropic linear viscoelastic material, the force-balance equation is often defined using the Kelvin-Voigt model of linear viscoelasticity to represent the stress-strain relation of the ECM. However, due to the multifaceted bio-physical nature of the ECM constituents, there are rheological aspects that cannot be effectively captured by this model and, therefore, depending on the type of biological tissue considered, other constitutive models of linear viscoelasticity may be better suited. In this work, we systematically assess the pattern formation potential of different stress-strain constitutive equations for the ECM within a mechanical model of pattern formation in biological tissues. The results obtained through linear stability analysis support the idea that constitutive equations capturing viscous flow and permanent set (Maxwell model, Jeffrey model) have a pattern formation potential much higher than the others (Kelvin-Voigt model, standard linear solid model), further confirmed by the results of our numerical simulations. Our findings suggest that further empirical work is required to acquire detailed quantitative information on the mechanical properties of components of the ECM in different biological tissues in order to furnish mechanochemical models of pattern formation with stress-strain constitutive equations for the ECM that provide a more faithful representation of the underlying tissue rheology.
We consider the problem of reaching a propositional goal condition in fully-observable non-deterministic (FOND) planning under a general class of fairness assumptions that are given explicitly. The fairness assumptions are of the form A/B and say that state trajectories that contain infinite occurrences of an action a from A in a state s and finite occurrence of actions from B, must also contain infinite occurrences of action a in s followed by each one of its possible outcomes. The infinite trajectories that violate this condition are deemed as unfair, and the solutions are policies for which all the fair trajectories reach a goal state. We show that strong and strong-cyclic FOND planning, as well as QNP planning, a planning model introduced recently for generalized planning, are all special cases of FOND planning with fairness assumptions of this form which can also be combined. FOND+ planning, as this form of planning is called, combines the syntax of FOND planning with some of the versatility of LTL for expressing fairness constraints. A new planner is implemented by reducing FOND+ planning to answer set programs, and the performance of the planner is evaluated in comparison with FOND and QNP planners, and LTL synthesis tools.
The Istanbul options were first introduced by Michel Jacques in 1997. These derivatives are considered as an extension of the Asian options. In this paper, we propose an analytical approximation formula for a geometric Istanbul call option (GIC) under the Black-Scholes model. Our approximate pricing formula is obtained in closed-form using a second-order Taylor expansion. We compare our theoretical results with those of Monte-Carlo simulations using the control variates method. Finally, we study the effects of changes in the price of the underlying asset on the value of GIC.
In this work, we study an equilibrium-based continuous asset pricing problem which seeks to form a price process endogenously by requiring it to balance the flow of sales-and-purchase orders in the exchange market, where a large number of agents are interacting through the market price. Adopting a mean field game (MFG) approach, we find a special form of forward-backward stochastic differential equations of McKean-Vlasov type with common noise whose solution provides a good approximate of the market price. We show the convergence of the net order flow to zero in the large N-limit and get the order of convergence in N under some conditions. We also extend the model to a setup with multiple populations where the agents within each population share the same cost and coefficient functions but they can be different population by population.