Search for: All records

SUMMARY The Ecuadorian Andes are a complex region characterized by accreted oceanic terranes driven by the ongoing subduction of the oceanic Nazca plate beneath South America. Present-day tectonics in Ecuador are linked to the downgoing plate geometry featuring the subduction of the aseismic, oceanic Carnegie Ridge, which is currently entering the trench. Using seismic tomography, we jointly invert arrival times of P and S waves from local and teleseismic earthquakes with surface wave dispersion curves to image the structure of the forearc and magmatic arc of the Ecuadorian Andes. Our data set includes > 100 000 traveltimes recorded at 294 stations across Ecuador. Our images show the basement of the central forearc is composed of accreted oceanic terranes with high elastic wave speeds. Inboard of the Carnegie Ridge, the westernmost forearc and coastal cordilleras display relatively low Vp and Vs and high Vp/Vs values, which we attribute to the increased hydration and fracturing of the overriding plate due to the subduction of the thick oceanic crust of the Carnegie Ridge. We additionally image across-arc differences in magmatic architecture. The frontal volcanic arc overlies accreted terranes and is characterized by low velocities and high Vp/Vs indicative of partial melt reservoirs which are limited to the upper crust. In contrast, the main arc displays regions of partial melt across a wider range of depths. The Subandean zone of Ecuador has two active volcanoes built on continental crust suggesting the arc is expanding eastwards. The mid to lower crust does not show indications of being modified from the magmatic process. We infer that the slab is in the process of flattening as a consequence of early-stage subduction of the buoyant Carnegie Ridge. 

We study the problem of certification: given queries to a function f : {0,1}n → {0,1} with certificate complexity ≤ k and an input x⋆, output a size-k certificate for f’s value on x⋆. For monotone functions, a classic local search algorithm of Angluin accomplishes this task with n queries, which we show is optimal for local search algorithms. Our main result is a new algorithm for certifying monotone functions with O(k8 logn) queries, which comes close to matching the information-theoretic lower bound of Ω(k logn). The design and analysis of our algorithm are based on a new connection to threshold phenomena in monotone functions. We further prove exponential-in-k lower bounds when f is non-monotone, and when f is monotone but the algorithm is only given random examples of f. These lower bounds show that assumptions on the structure of f and query access to it are both necessary for the polynomial dependence on k that we achieve. 

We design an algorithm for finding counterfactuals with strong theoretical guarantees on its performance. For any monotone model f:Xd→{0,1} and instance x⋆, our algorithm makes S(f)O(Δf(x⋆))⋅logd {queries} to f and returns an {\sl optimal} counterfactual for x⋆: a nearest instance x′ to x⋆ for which f(x′)≠f(x⋆). Here S(f) is the sensitivity of f, a discrete analogue of the Lipschitz constant, and Δf(x⋆) is the distance from x⋆ to its nearest counterfactuals. The previous best known query complexity was dO(Δf(x⋆)), achievable by brute-force local search. We further prove a lower bound of S(f)Ω(Δf(x⋆))+Ω(logd) on the query complexity of any algorithm, thereby showing that the guarantees of our algorithm are essentially optimal.