×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.

Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Click here to flash read.

We are interested in measures of central tendency for a population on a
network, which is modeled by a metric tree. The location parameters that we
study are generalized Fr\'echet means obtained by minimizing the objective
function $\alpha \mapsto E[\ell(d(\alpha,X))]$ where $\ell$ is a generic convex
nondecreasing loss.


We leverage the geometry of the tree and the geodesic convexity of the
objective to develop a notion of directional derivative in the tree, which
helps up locate and characterize the minimizers.


Estimation is performed using a sample analog. We extend to a metric tree the
notion of stickiness defined by Hotz et al. (2013), we show that this
phenomenon has a non-asymptotic component and we obtain a sticky law of large
numbers. For the particular case of the Fr\'echet median, we develop
non-asymptotic concentration bounds and sticky central limit theorems.

Click here to read this post out
ID: 508424; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: Oct. 29, 2023, 7:35 a.m. Changes:
Dictionaries:
Words:
Spaces:
Views: 25
CC:
No creative common's license
Comments: