The study examines biases in Kiva.org's microfinance platform and proposes methods to mitigate them.
problem Identifying and mitigating hidden biases in lender preferences for different sectors on Kiva.org.
method The study uses causal inference and regression models with Bayesian variable selection methods to investigate and quantify biases. Fairness constraints are then incorporated to maintain comparable results.
result The influence of economic factors and loan attributes on lender preferences varies by sector, and models can be adjusted to mitigate biases.
We propose an in-depth study of lending behaviors in Kiva using a mix of quantitative and large-scale data mining techniques. Kiva is a non-profit organization that offers an online platform to connect lenders with borrowers. Their site, kiva.org, allows citizens to microlend small amounts of money to entrepreneurs (bo…
Kiva is an online non-profit crowdsouring microfinance platform that raises funds for the poor in the third world. The borrowers on Kiva are small business owners and individuals in urgent need of money. To raise funds as fast as possible, they have the option to form groups and post loan requests in the name of their …
The paper proves formulas for capillary surfaces and applies them to inequalities and area estimates.
problem Understanding capillary surfaces and their properties.
method Established monotonicity formulas for capillary surfaces in half-space and unit ball.
result Extended Li-Yau-type inequalities and optimal area estimates for capillary surfaces.
Special issue on understanding physical processes from unusual diffusion patterns.
problem Understanding physical processes from anomalous diffusion data.
method Not explicitly described in the abstract, but likely involves analysis of data from the Anomalous Diffusion Challenge.
result Not explicitly stated, but likely includes analysis of physical processes from anomalous diffusion data.
This article was withdrawn by the arXiv.org administrators since it plagiarizes math.AT/0401211.
This article was withdrawn by the arXiv.org administrators since it plagiarizes math.GT/0011056.
The MIT/IEEE/Amazon GraphChallenge.org encourages community approaches to developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present unique scalability difficulties. The proposed Sparse Deep Neural Network (DNN) Challenge draws upon prior challenges from machine learning, high performanc…
Let be given a {\em colored 3-pseudo-triangulation} H⋆ with n tetrahedra. Colored means that each tetrahedron have vertices distinctively colored 0,1,2,3. In a {\em pseudo} 3-triangulation the intersection of simplices might be subsets of simplices of smaller dimensions (faces), instead of a single m…
New method provides fine-grained feedback on interactive student programs.
problem Time-consuming manual grading of interactive student programs.
method Meta-exploration approach using reinforcement learning.
result 94.3% accuracy in providing fine-grained feedback.
Paper withdrawn because of a gap in the proof of Proposition 3 of Thomas Schick: "Integrality of L2-Betti numbers", Math. Ann. 317, 727-750 (arXiv.org/abs/math.gt/0001101). Most results of the withdrawn paper were based on this proposition.
Minimal grid diagrams for 12-crossing prime knots identified.
problem Identifying minimal grid diagrams for prime knots.
method Listed minimal grid diagrams for 12-crossing prime knots.
result Provided a list of minimal grid diagrams for 12-crossing prime knots.
This paper has been withdrawn from arXiv.org due to a disagreement among the authors related to several peer-review comments received prior to submission on arXiv.org. Even though the current version of this paper is withdrawn, there was no disagreement between authors on the novel work in this paper. One specific issu…
Extends fibering theorems for 3-manifolds.
problem Fibering compact 3-manifolds over the circle.
method Generalizes Moon and Griffiths' theorems.
result New fibering results for 3-manifolds.
These are lecture notes from the Clay Mathematics Institute summer school ``Floer Homology, Gauge Theory, and Low Dimensional Topology'' Alfred Renyi Institute; www.claymath.org/programs/summer_school/2004/. The main goal of these notes is to sketch a proof of Giroux correspondence between open book decompositions of t…
Sparse DNNs face scalability issues; MIT/IEEE/Amazon challenge analyzes best solutions.
problem Scalability issues in Sparse Deep Neural Networks (DNNs).
method Mathematically defined DNN inference computation, community submissions from various fields.
result Sparse DNN execution time, TmDNN, is strongly dependent on the number of operations, Nmop. We initiate a new study of differential operators with symmetries and combine this with the study of branching laws for Verma modules of reductive Lie algebras. By the criterion for discretely decomposable and multiplicity-free restrictions of generalized Verma modules [T. Kobayashi, http://dx.doi.org/10.1007/s00031-01…
This survey covers some of the results contained in the papers by Costantino, Geer and Patureau (https://arxiv.org/abs/1202.3553) and by Blanchet, Costantino, Geer and Patureau (https://arxiv.org/abs/1404.7289). In the first one the authors construct two families of Reshetikhin-Turaev-type invariants of 3-manifolds, $\…
This paper continues arXiv.org:math.AG/0609256 and arXiv:0708.3991 Using authors's methods of 1980, 1981, some explicit finite sets of number fields containing all ground fields of arithmetic hyperbolic reflection groups in dimensions at least 4 are defined, and good explicit bounds of their degrees (over Q) are obtain…
The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in http://arxiv.org/abs/math.AG/0209253. The result is established with the help of the …
New construction reduces Vietoris-Rips complex construction time.
problem Efficiently constructing Vietoris-Rips complexes.
method Inductive construction avoiding unnecessary comparisons.
result Significant reduction in computational complexity.
Random Forests [Breiman:2001] (RF) are a fully non-parametric statistical method requiring no distributional assumptions on covariate relation to the response. RF are a robust, nonlinear technique that optimizes predictive accuracy by fitting an ensemble of trees to stabilize model estimates. The randomForestSRC packag…
When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that our a…
We introduce 'mixed LICORS', an algorithm for learning nonlinear, high-dimensional dynamics from spatio-temporal data, suitable for both prediction and simulation. Mixed LICORS extends the recent LICORS algorithm (Goerg and Shalizi, 2012) from hard clustering of predictive distributions to a non-parametric, EM-like sof…
A recent paper (arxiv.org:1810.00025) studied properties of a compactification of the moduli space of irreducible Hermitian-Yang-Mills connections on a hermitian bundle over a projective algebraic manifold. In this follow-up note, we show that the Yang-Mills flow at infinity on the space of semistable integrable connec…
SFC aims to protect the Amazon with a digital currency and smart contracts.
problem Protecting the Amazon's ecosystem and ensuring resource credibility.
method Blockchain, digital contracts, smart contracts with oracles.
result Ensures credibility and security for financial resources invested in Amazon projects.
This paper continues arXiv.org:math.AG/0609256, arXiv:0708.3991 and arXiv:0710.0162 . Using authors's methods of 1980, 1981, some explicit finite sets of number fields containing all ground fields of arithmetic hyperbolic reflection groups in dimension at least 3 are defined, and explicit bounds of their degrees (over …
I introduce Forecastable Component Analysis (ForeCA), a novel dimension reduction technique for temporally dependent signals. Based on a new forecastability measure, ForeCA finds an optimal transformation to separate a multivariate time series into a forecastable and an orthogonal white noise space. I present a converg…
Finding a well-performing architecture is often tedious for both DL practitioners and researchers, leading to tremendous interest in the automation of this task by means of neural architecture search (NAS). Although the community has made major strides in developing better NAS methods, the quality of scientific empiric…
For later use in subsequent upcoming arxiv.org prepublications, basic foundational material on local, smooth or real analytic, CR-generic submanifolds of complex Euclidean spaces is developed from scratch, with strong emphasis on the interplay between extrinsic and intrinsic aspects, a constructive option that commands…
We present a method of variable selection for the sparse generalized additive model. The method doesn't assume any specific functional form, and can select from a large number of candidates. It takes the form of incremental forward stagewise regression. Given no functional form is assumed, we devised an approach termed…
Deep learning method clusters multi-view data matrices.
problem Clustering heterogeneous relational data matrices.
method Deep collective matrix tri-factorization (DCMTF).
result Discover latent clusters across input matrices and their associations.
We show that there exist knots K in S^3 with g(E(K))=2 and g(E(K#K#K))=6. Together with Theorem~1.5 of [1], this proves existence of counterexamples to Morimoto's Conjecture (Conjecture 1.5 of [2]). This is a special case of arxiv.org/abs/math.GT/0701765 [1] Tsuyoshi Kobayashi and Yo'av Rieck. On the growth rate of the…
Current daily paper releases are becoming increasingly large and areas of research are growing in diversity. This makes it harder for scientists to keep up to date with current state of the art and identify relevant work within their lines of interest. The goal of this article is to address this problem using Machine L…
L0Learn solves sparse learning problems with millions of features.
problem Sparse learning problems with millions of features.
method Approximate algorithms based on coordinate descent and local combinatorial optimization.
result Achieves competitive run times and statistical performance.
Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution rule,https://doi.org/10.1088/1361-6544/ab1275] that for a connected self-similar set, space-filling curves can be c…
It is natural to try to place the new polynomial invariants of links in algebraic topology (e.g. to try to interpret them using homology or homotopy groups). However, one can think that these new polynomial invariants are byproducts of a new more delicate algebraic invariant of 3-manifolds which measures the obstructio…
Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design efficient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. S…
We present SemEval-2019 Task 8 on Fact Checking in Community Question Answering Forums, which features two subtasks. Subtask A is about deciding whether a question asks for factual information vs. an opinion/advice vs. just socializing. Subtask B asks to predict whether an answer to a factual question is true, false or…
This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la arXiv:1506.00339, (ii) evaluating Racah/mixing matrices for various numbers of strands in var…
We explore visual representations of tilings corresponding to Schläfli symbols. In three dimensions, we call these tilings "honeycombs". Schläfli symbols encode, in a very efficient way, regular tilings of spherical, euclidean and hyperbolic spaces in all dimensions. In three dimensions, there are only a finite number …
Basing on evaluation of the Racah coefficients for SU_q(3) (which supported the earlier conjecture of their universal form) we derive explicit formulas for all the 5-, 6- and 7-strand Wilson averages in the fundamental representation of arbitrary SU(N) group (the HOMFLY polynomials). As an application, we list the answ…
DoWhy-GCM extends causal inference in graphical models for diverse queries.
problem Addressing diverse causal queries in graphical causal models.
method Specify cause-effect relations via a causal graph, fit causal mechanisms, pose causal queries.
result Identification of root causes, attribution of causal influences, diagnosis of causal structures.
DoubleML is a Python library for causal inference using machine learning.
problem Estimating causal parameters in complex models with machine learning.
method Double machine learning framework for valid statistical inference.
result High flexibility and easy extension for various model specifications.
This paper uses natural language processing to create the first machine-coded democracy index, which I call Automated Democracy Scores (ADS). The ADS are based on 42 million news articles from 6,043 different sources and cover all independent countries in the 1993-2012 period. Unlike the democracy indices we have today…
We present a novel method for obtaining high-quality, domain-targeted multiple choice questions from crowd workers. Generating these questions can be difficult without trading away originality, relevance or diversity in the answer options. Our method addresses these problems by leveraging a large corpus of domain-speci…
Motivation: Cell-biological processes are regulated through a complex network of interactions between genes and their products. The processes, their activating conditions, and the associated transcriptional responses are often unknown. Organism-wide modeling of network activation can reveal unique and shared mechanisms…
In this paper we describe a 1-dimensional family of initial conditions Σthat provides reduced periodic solution of the three body problem. This family Σcontains a bifurcation point and extend the periodic solution described in (Perdomo, http://arxiv.org/pdf/1507.01100.pdf). This 1-dimensional family is the union of two…